|
|
|
|
|
CSC541A - DATA ANALYTICS (2022 Batch) | |
Total Teaching Hours for Semester:45 |
No of Lecture Hours/Week:3 |
Max Marks:100 |
Credits:3 |
Course Objectives/Course Description |
|
This course is to help students learn, understand, and practice data analytics from the chosen domain. The better understanding of Data, Relations, Preprocessing, Visualization, Correlation, Regression and Clustering plays an important role to find a formidable answer for any kind of applications. |
|
Learning Outcome |
|
CO1: Demonstrate the fundamental principles of data analytics. CO2: Apply appropriate preprocessing and visualization techniques on the data set. CO3: Design data analytic models for effective decision-making. |
Unit-1 |
Teaching Hours:9 |
Introduction
|
|
Data Analysis, Data Mining and Knowledge Discovery. | |
Unit-1 |
Teaching Hours:9 |
Data and Relations
|
|
The Iris Data Set - Data Scales - Set and Matrix representations - Relations - Dissmilarity measures - Similarity measures - Sequence Relations - Sampling and Quantization. | |
Unit-1 |
Teaching Hours:9 |
Introduction
|
|
Data Analysis, Data Mining and Knowledge Discovery. | |
Unit-1 |
Teaching Hours:9 |
Data and Relations
|
|
The Iris Data Set - Data Scales - Set and Matrix representations - Relations - Dissmilarity measures - Similarity measures - Sequence Relations - Sampling and Quantization. | |
Unit-2 |
Teaching Hours:9 |
Data Visualization
|
|
Diagrams - Principal Component Analysis - Multidimensional Scaling - Associator - Histograms. | |
Unit-2 |
Teaching Hours:9 |
Data Preprocessing
|
|
Error types - Error Handling - Filtering - Data Transformation - Data Integration. | |
Unit-2 |
Teaching Hours:9 |
Data Visualization
|
|
Diagrams - Principal Component Analysis - Multidimensional Scaling - Associator - Histograms. | |
Unit-2 |
Teaching Hours:9 |
Data Preprocessing
|
|
Error types - Error Handling - Filtering - Data Transformation - Data Integration. | |
Unit-3 |
Teaching Hours:9 |
Correlation
|
|
Linear Correlation - Correlation and Causality - Chi-square Test for Independence. | |
Unit-3 |
Teaching Hours:9 |
Regression
|
|
Linear Regression - Linear Regression with Nonlinear Substitution - Robust Regression - Neural Networks - Radial Basis Function Networks - Cross-Validation - Feature Selection. | |
Unit-3 |
Teaching Hours:9 |
Correlation
|
|
Linear Correlation - Correlation and Causality - Chi-square Test for Independence. | |
Unit-3 |
Teaching Hours:9 |
Regression
|
|
Linear Regression - Linear Regression with Nonlinear Substitution - Robust Regression - Neural Networks - Radial Basis Function Networks - Cross-Validation - Feature Selection. | |
Unit-4 |
Teaching Hours:9 |
Forecasting
|
|
Finite State Machines - Recurrent Models - Autoregressive Models. | |
Unit-4 |
Teaching Hours:9 |
Classification
|
|
Classification criteria - Naive Bayes Classifier - Linear Discriminant Analysis - Support Vector Machine - Nearest Neighbor Classifier - Decision Trees. | |
Unit-4 |
Teaching Hours:9 |
Forecasting
|
|
Finite State Machines - Recurrent Models - Autoregressive Models. | |
Unit-4 |
Teaching Hours:9 |
Classification
|
|
Classification criteria - Naive Bayes Classifier - Linear Discriminant Analysis - Support Vector Machine - Nearest Neighbor Classifier - Decision Trees. | |
Unit-5 |
Teaching Hours:9 |
Clustering
|
|
Cluster Partitions - K-Means Clustering - Hierarchy Clustering - Prototype-Based Clustering - Fuzzy Clustering - Relational Clustering - Cluster Tendency Assessment - Cluster Validity - Self-Organizing Map. | |
Unit-5 |
Teaching Hours:9 |
Optimization Methods
|
|
Optimization with Derivatives - Gradient Descent. | |
Unit-5 |
Teaching Hours:9 |
Clustering
|
|
Cluster Partitions - K-Means Clustering - Hierarchy Clustering - Prototype-Based Clustering - Fuzzy Clustering - Relational Clustering - Cluster Tendency Assessment - Cluster Validity - Self-Organizing Map. | |
Unit-5 |
Teaching Hours:9 |
Optimization Methods
|
|
Optimization with Derivatives - Gradient Descent. | |
Text Books And Reference Books:
| |
Essential Reading / Recommended Reading
| |
Evaluation Pattern CIA - 50% ESE - 50% | |
CSC541B - INTERNET OF THINGS (2022 Batch) | |
Total Teaching Hours for Semester:45 |
No of Lecture Hours/Week:3 |
Max Marks:100 |
Credits:3 |
Course Objectives/Course Description |
|
To explore students to the world of interconnected devices, communication among these connected devices, transfer of data and further analysis of this data to make appropriate decisions |
|
Learning Outcome |
|
CO1: Analyze the functional blocks involved in Internet of Things. CO2: Understand the architecture of Internet of Things. CO3: Infer the process of analysing data in Internet of Things. CO4: Demonstrate the application of IoT in real world. |
Unit-1 |
Teaching Hours:9 |
Introduction to Internet of Things
|
|
Introduction, Definition and Characteristics of IoT, Physical Design of IoT, Things in IoT, IoT Protocols, Logical Design of IoT, IoT Functional Blocks, IoT Communication Models, IoT Communications APIs, IoT Enabling Technologies, Wireless Sensor Networks, Cloud Computing, Big Data Analytics, Communication Protocols, Embedded Systems. | |
Unit-1 |
Teaching Hours:9 |
Introduction to Internet of Things
|
|
Introduction, Definition and Characteristics of IoT, Physical Design of IoT, Things in IoT, IoT Protocols, Logical Design of IoT, IoT Functional Blocks, IoT Communication Models, IoT Communications APIs, IoT Enabling Technologies, Wireless Sensor Networks, Cloud Computing, Big Data Analytics, Communication Protocols, Embedded Systems. | |
Unit-2 |
Teaching Hours:9 |
IoT Physical Devices and EndPoints
|
|
What is an IoT Device, Exemplary Device: Raspberry Pi, About the Board, Linux on Raspberry Pi, Raspberry Pi interfaces, Programming Raspberry Pi with Python. Other IoT Devices – pcDuino, BeagleBone Black, Cubieboard. | |
Unit-2 |
Teaching Hours:9 |
IoT Physical Devices and EndPoints
|
|
What is an IoT Device, Exemplary Device: Raspberry Pi, About the Board, Linux on Raspberry Pi, Raspberry Pi interfaces, Programming Raspberry Pi with Python. Other IoT Devices – pcDuino, BeagleBone Black, Cubieboard. | |
Unit-3 |
Teaching Hours:9 |
Domain Specific IoTs and M2M
|
|
Home Automation, Cities, Environment, Energy, Retail, Logistics, Agriculture, Industry, Health & Lifestyle. IoT and M2M – Introduction, M2M, Difference between IoT and M2M, SDN and NFV for IoT. | |
Unit-3 |
Teaching Hours:9 |
Domain Specific IoTs and M2M
|
|
Home Automation, Cities, Environment, Energy, Retail, Logistics, Agriculture, Industry, Health & Lifestyle. IoT and M2M – Introduction, M2M, Difference between IoT and M2M, SDN and NFV for IoT. | |
Unit-4 |
Teaching Hours:9 |
Arduino Programming
|
|
The Arduino Ecosystem, Installing the software, Connecting the Arduino, Opening a sketch, Sketching in code, The Structure of Arduino C, Verifying and Uploading, Working with variables, Making Decisions, Digital Ins and Outs, Analog In, Analog Out. | |
Unit-4 |
Teaching Hours:9 |
Arduino Programming
|
|
The Arduino Ecosystem, Installing the software, Connecting the Arduino, Opening a sketch, Sketching in code, The Structure of Arduino C, Verifying and Uploading, Working with variables, Making Decisions, Digital Ins and Outs, Analog In, Analog Out. | |
Unit-5 |
Teaching Hours:9 |
Infrastructure and Service Discovery Protocols for the IoT Ecosystem
|
|
Infrastructure Protocols: Routing Protocol, IEEE 802.15.4, Bluetooth Low Energy, Z-Wave, ZigBee. Protocols for IoT Service Discovery: multicast Domain Name System (mDNS), DNS Service Discovery, Universal Plug and Play. Prominent IoT Service Discovery Products available in the market. | |
Unit-5 |
Teaching Hours:9 |
Infrastructure and Service Discovery Protocols for the IoT Ecosystem
|
|
Infrastructure Protocols: Routing Protocol, IEEE 802.15.4, Bluetooth Low Energy, Z-Wave, ZigBee. Protocols for IoT Service Discovery: multicast Domain Name System (mDNS), DNS Service Discovery, Universal Plug and Play. Prominent IoT Service Discovery Products available in the market. | |
Text Books And Reference Books: [1] Arshdeep Bahga and Vijay Madisetti , "Internet of Things: A Hands-on Approach", Universities Press, 2015 [2] Pethuru Raj and Anupama C. Raman , “The Internet of Things: Enabling Technologies, Platforms, and Use Cases", CRC Press, 2017. [3] Brian Evans, Beginning Arduino Programming, Apress, 2011 | |
Essential Reading / Recommended Reading [1] March Schwartz, “Internet of Things with Arduino Cookbook”, Packt Publishing, 2016 [2] Olivier Hersent , David Boswarthick, Omar Elloumi , “The Internet of Things – Key applications and Protocols”, Wiley, 2012. [3]Peter Waher, “Mastering Internet of Things: Design and create your own IoT applications using Raspberry Pi 3”, Packt Publishing, 2018 | |
Evaluation Pattern CIA 50% ESE 50% | |
CSC541C - DIGITAL IMAGE PROCESSING (2022 Batch) | |
Total Teaching Hours for Semester:45 |
No of Lecture Hours/Week:3 |
Max Marks:100 |
Credits:3 |
Course Objectives/Course Description |
|
Effective implementation of a Business Intelligence (BI) results in better business decisions and increased success in achieving goals. Business intelligence is the process of collecting and turning the resource into business value. This course will provide an understanding of business intelligence, knowledge delivery and examine the BI processes and techniques used in transforming data to knowledge and value. |
|
Learning Outcome |
|
CO1: Understand the fundamentals of business intelligence. CO2: Apply various modeling techniques and business intelligence methods to various situations using data mining principles. CO3: Demonstrate the impact of business reporting, information visualization, and dashboards. |
Unit-1 |
Teaching Hours:9 |
Introduction to Business Intelligence
|
|
Introduction to OLTP and OLAP, BI Definitions & Concepts, Business Applications of BI, BI Framework, Role of Data Warehousing in BI, BI Infrastructure Components – BI Process, BI Technology, BI Roles & Responsibilities. | |
Unit-1 |
Teaching Hours:9 |
Introduction to Business Intelligence
|
|
Introduction to OLTP and OLAP, BI Definitions & Concepts, Business Applications of BI, BI Framework, Role of Data Warehousing in BI, BI Infrastructure Components – BI Process, BI Technology, BI Roles & Responsibilities. | |
Unit-2 |
Teaching Hours:10 |
Basics of Data Integration ETL
|
|
Concepts of data integration need and advantages of using data integration, introduction to common data integration approaches, introduction to ETL, Introduction to data quality, data profiling concepts and applications. | |
Unit-2 |
Teaching Hours:10 |
Basics of Data Integration ETL
|
|
Concepts of data integration need and advantages of using data integration, introduction to common data integration approaches, introduction to ETL, Introduction to data quality, data profiling concepts and applications. | |
Unit-3 |
Teaching Hours:9 |
Introduction to Multi-Dimensional Data Modeling
|
|
Introduction to data and dimension modeling, multidimensional data model, ER Modeling vs. multi-dimensional modeling, concepts of dimensions, facts, cubes, attribute, hierarchies, star and snowflake schema. | |
Unit-3 |
Teaching Hours:9 |
Introduction to Multi-Dimensional Data Modeling
|
|
Introduction to data and dimension modeling, multidimensional data model, ER Modeling vs. multi-dimensional modeling, concepts of dimensions, facts, cubes, attribute, hierarchies, star and snowflake schema. | |
Unit-4 |
Teaching Hours:9 |
Basics of Enterprise Reporting
|
|
Introduction to enterprise reporting, concepts of dashboards, balanced scorecards, and overall architecture. | |
Unit-4 |
Teaching Hours:9 |
Basics of Enterprise Reporting
|
|
Introduction to enterprise reporting, concepts of dashboards, balanced scorecards, and overall architecture. | |
Unit-5 |
Teaching Hours:8 |
Data Mining Functionalities
|
|
Association rules mining, Mining Association rules from single level, multilevel transaction databases, Classification and prediction, Decision tree induction, Bayesian Classification, knearest neighbour classification. | |
Unit-5 |
Teaching Hours:8 |
Data Mining Functionalities
|
|
Association rules mining, Mining Association rules from single level, multilevel transaction databases, Classification and prediction, Decision tree induction, Bayesian Classification, knearest neighbour classification. | |
Text Books And Reference Books: [1] CindiHowson ,Successful Business Intelligence, Unlock the Value of BI & Big Data Hardcover –Second Edition: Import, 1 Nov 2013. | |
Essential Reading / Recommended Reading [1] Gert H.N. Laursen, JesperThorlund , Business Analytics for Managers: Taking Business Intelligence beyond Reporting Paperback , 26 Sep 2013 | |
Evaluation Pattern CIA: 50%
ESE: 50%
| |
CSC541D - BUSINESS INTELLIGENCE (2022 Batch) | |
Total Teaching Hours for Semester:45 |
No of Lecture Hours/Week:3 |
Max Marks:100 |
Credits:3 |
Course Objectives/Course Description |
|
Effective implementation of a Business Intelligence (BI) results in better business decisions and increased success in achieving goals. Business intelligence is the process of collecting and turning the resource into business value. This course will provide an understanding of business intelligence, knowledge delivery and examine the BI processes and techniques used in transforming data to knowledge and value. |
|
Learning Outcome |
|
CO1: Understand the fundamentals of business intelligence. CO2: Apply various modeling techniques and business intelligence methods to various situations using data mining principles. CO3: Demonstrate the impact of business reporting, information visualization, and dashboards. |
Unit-1 |
Teaching Hours:9 |
||
Introduction to Business Intelligence
|
|||
Introduction to OLTP and OLAP, BI Definitions & Concepts, Business Applications of BI, BI Framework, Role of Data Warehousing in BI, BI Infrastructure Components – BI Process, BI Technology, BI Roles & Responsibilities. | |||
Unit-1 |
Teaching Hours:9 |
||
Introduction to Business Intelligence
|
|||
Introduction to OLTP and OLAP, BI Definitions & Concepts, Business Applications of BI, BI Framework, Role of Data Warehousing in BI, BI Infrastructure Components – BI Process, BI Technology, BI Roles & Responsibilities. | |||
Unit-2 |
Teaching Hours:10 |
||
Basics of Data Integration ETL
|
|||
Concepts of data integration need and advantages of using data integration, introduction to common data integration approaches, introduction to ETL, Introduction to data quality, data profiling concepts and applications. | |||
Unit-2 |
Teaching Hours:10 |
||
Basics of Data Integration ETL
|
|||
Concepts of data integration need and advantages of using data integration, introduction to common data integration approaches, introduction to ETL, Introduction to data quality, data profiling concepts and applications. | |||
Unit-3 |
Teaching Hours:9 |
||
Introduction to Multi-Dimensional Data Modeling
|
|||
Introduction to data and dimension modeling, multidimensional data model, ER Modeling vs. multi-dimensional modeling, concepts of dimensions, facts, cubes, attribute, hierarchies, star and snowflake schema. | |||
Unit-3 |
Teaching Hours:9 |
||
Introduction to Multi-Dimensional Data Modeling
|
|||
Introduction to data and dimension modeling, multidimensional data model, ER Modeling vs. multi-dimensional modeling, concepts of dimensions, facts, cubes, attribute, hierarchies, star and snowflake schema. | |||
Unit-4 |
Teaching Hours:9 |
||
Basics of Enterprise Reporting
|
|||
Introduction to enterprise reporting, concepts of dashboards, balanced scorecards, and overall architecture. | |||
Unit-4 |
Teaching Hours:9 |
||
Basics of Enterprise Reporting
|
|||
Introduction to enterprise reporting, concepts of dashboards, balanced scorecards, and overall architecture. | |||
Unit-5 |
Teaching Hours:8 |
||
Data Mining Functionalities
|
|||
Association rules mining, Mining Association rules from single level, multilevel transaction databases, Classification and prediction, Decision tree induction, Bayesian Classification, knearest neighbour classification. | |||
Unit-5 |
Teaching Hours:8 |
||
Data Mining Functionalities
|
|||
Association rules mining, Mining Association rules from single level, multilevel transaction databases, Classification and prediction, Decision tree induction, Bayesian Classification, knearest neighbour classification. | |||
Text Books And Reference Books: [1] CindiHowson ,Successful Business Intelligence, Unlock the Value of BI & Big Data Hardcover –Second Edition: Import, 1 Nov 2013. | |||
Essential Reading / Recommended Reading [1] Gert H.N. Laursen, JesperThorlund , Business Analytics for Managers: Taking Business Intelligence beyond Reporting Paperback , 26 Sep 2013 | |||
Evaluation Pattern CIA: 50%
ESE: 50%
| |||
CSC542A - UNIX OPERATING SYSTEM (2022 Batch) | |||
Total Teaching Hours for Semester:45 |
No of Lecture Hours/Week:3 |
||
Max Marks:100 |
Credits:3 |
||
Course Objectives/Course Description |
|||
UNIX is a multi user and multi-tasking operating system. After learning the concepts of an operating system, it is appropriate to learn how UNIX implements these concepts. The subject is introduced with the features and architecture of UNIX. The file system, Process management and Memory management are discussed to make the students understand the internals of UNIX. Various commands used by UNIX shell is also discussed which makes the users of UNIX comfortable to interact with each other. Bourne shell programming is dealt in depth which can be used to develop applications in UNIX. |
|||
Learning Outcome |
|||
CO1: Describe the architecture and features of UNIX Operating System and distinguish it from other Operating System CO2: Apply and change the ownership and file permissions using advance Unix commands. CO3: Build Regular expression to perform pattern matching using utilities like grep, sed and awk. CO4: Implement shell scripts for real time applications. |
Unit-1 |
Teaching Hours:8 |
Introduction to UNIX
|
|
Evolution of UNIX – UNIX System Structure – Features of Unix - Operating System Services - Unix Kernel - Locating Commands, Internal and External Commands, Flexibility of Command Usage, man: Browsing and Manual Pages On-line, Understanding the man Documentation. General Purpose Utilities: cal, date, echo, printf, echo, bc, script, passwd, who, uname, tty, stty. | |
Unit-1 |
Teaching Hours:8 |
Introduction to UNIX
|
|
Evolution of UNIX – UNIX System Structure – Features of Unix - Operating System Services - Unix Kernel - Locating Commands, Internal and External Commands, Flexibility of Command Usage, man: Browsing and Manual Pages On-line, Understanding the man Documentation. General Purpose Utilities: cal, date, echo, printf, echo, bc, script, passwd, who, uname, tty, stty. | |
Unit-2 |
Teaching Hours:9 |
The UNIX file system
|
|
The File, I-nodes – Structure of a regular file. The HOME Variable: The Home Directory, Directory related commands: pwd, mkdir, cd, rmdir. Absolute and relative path names. The UNIX File System. File manipulation commands: cat, cp, rm, mv, more, The lp Subsystem: Printing a File, file, wc, Words and Characters, od, The spell and ispell, cmp, comm, diff. File compression commands: gzip, gunzip, tar, zip, unzip. Basic file attributes: The –d Option: Listing Directory Attributes, File Ownership, File Permissions, chmod: Changing File Permissions, Directory Permissions, Changing File Ownership. Hard links, Symbolic Links, ln, umask, and find. | |
Unit-2 |
Teaching Hours:9 |
The UNIX file system
|
|
The File, I-nodes – Structure of a regular file. The HOME Variable: The Home Directory, Directory related commands: pwd, mkdir, cd, rmdir. Absolute and relative path names. The UNIX File System. File manipulation commands: cat, cp, rm, mv, more, The lp Subsystem: Printing a File, file, wc, Words and Characters, od, The spell and ispell, cmp, comm, diff. File compression commands: gzip, gunzip, tar, zip, unzip. Basic file attributes: The –d Option: Listing Directory Attributes, File Ownership, File Permissions, chmod: Changing File Permissions, Directory Permissions, Changing File Ownership. Hard links, Symbolic Links, ln, umask, and find. | |
Unit-3 |
Teaching Hours:9 |
UNIX process management
|
|
Process Basics, Process States and Transitions, ps: Process Status, System Processes (-e or –a), Internal and External Commands, Running Jobs in Background, nice: Job Execution With Low Priority, Killing Processes with Signals, Job Control, at and batch: Execute Later, cron: Running Jobs Periodically, time: Timing Processes. PID and PPID. | |
Unit-3 |
Teaching Hours:9 |
UNIX process management
|
|
Process Basics, Process States and Transitions, ps: Process Status, System Processes (-e or –a), Internal and External Commands, Running Jobs in Background, nice: Job Execution With Low Priority, Killing Processes with Signals, Job Control, at and batch: Execute Later, cron: Running Jobs Periodically, time: Timing Processes. PID and PPID. | |
Unit-4 |
Teaching Hours:9 |
Filters and communication simple filters
|
|
The Sample Database, pr: Paginating Files, head: Displaying the Beginning of a File, tail: Displaying the End of a File, cut: Slitting a File Vertically, paste: Pasting Files, sort: Ordering a File, uniq: Locate Repeated and Non repeated Lines, tr: Translating Characters, An Example: Displaying a Word-count List. Filters using regular expressions: grep: Searching for a Pattern, and egrep. Communication: Communicating with Other Users: Who, Mail, Wall, Send, Mesg, Ftp. | |
Unit-4 |
Teaching Hours:9 |
Filters and communication simple filters
|
|
The Sample Database, pr: Paginating Files, head: Displaying the Beginning of a File, tail: Displaying the End of a File, cut: Slitting a File Vertically, paste: Pasting Files, sort: Ordering a File, uniq: Locate Repeated and Non repeated Lines, tr: Translating Characters, An Example: Displaying a Word-count List. Filters using regular expressions: grep: Searching for a Pattern, and egrep. Communication: Communicating with Other Users: Who, Mail, Wall, Send, Mesg, Ftp. | |
Unit-5 |
Teaching Hours:10 |
UNIX shell environment
|
|
The Wild-cards, Escaping and Quoting, Redirection; Review of vi Operations – Different Modes – Saving and Exiting - Accessing Multiple Files - Interacting with Unix - Miscellaneous Commands - Alphabetical List of Keys. Shell variables - Shell Keywords - Positional parameters - Passing command line arguments. Arithmetic in shell scripts - Read and Echo - Control Structures - if-then-fi - if-then-else-fi - Nested if - Case control structure – Loops - while-until –for - break and continue. Shell meta characters - Exporting variables - User defined Functions. | |
Unit-5 |
Teaching Hours:10 |
UNIX shell environment
|
|
The Wild-cards, Escaping and Quoting, Redirection; Review of vi Operations – Different Modes – Saving and Exiting - Accessing Multiple Files - Interacting with Unix - Miscellaneous Commands - Alphabetical List of Keys. Shell variables - Shell Keywords - Positional parameters - Passing command line arguments. Arithmetic in shell scripts - Read and Echo - Control Structures - if-then-fi - if-then-else-fi - Nested if - Case control structure – Loops - while-until –for - break and continue. Shell meta characters - Exporting variables - User defined Functions. | |
Text Books And Reference Books:
[1] Sumitabha Das. UNIX Concepts and Applications. 5th Edition, New Delhi: Tata McGraw Hill, 2013. [2] Yashavant P Kanetkar. Unix Shell Programming. New Delhi: BPB Publications, 2012. | |
Essential Reading / Recommended Reading
[1] Maurice J Bach. The Design of Unix Operating System. NewDelhi: Prentice Hall of India Pvt. Ltd, 2012. [2] Paul Love, Joe Merlino, Craig Zimmerman, Jeremy C. Reed, and Paul Weinstein. Beginning UNIX. New Delhi: Wiley Publishing, Inc, (Wrox Publishing) 2007 | |
Evaluation Pattern CIA - 50% ESE - 50% | |
CSC542B - WEB TECHNOLOGY (2022 Batch) | |
Total Teaching Hours for Semester:45 |
No of Lecture Hours/Week:45 |
Max Marks:100 |
Credits:3 |
Course Objectives/Course Description |
|
This course is designed to introduce the students to web technologies in Hyper Text Mark-up Language, Cascade Style Sheet, JavaScript and PHP for interactive web applications that use rich user interfaces and also understand the server-side web technologies for creating dynamic web applications. Student will learn the concepts of web site planning and hosting. This course will help them to create an interactive website with great look and functionality.
|
|
Learning Outcome |
|
CO1: Understand the World Wide Web and associated technologies. CO2: Apply web development techniques for designing web pages. CO3: Design an interactive website with web tools and scripting methods |
Unit-1 |
Teaching Hours:7 |
Web Programming Introduction
|
|
Web technology terminology-Structure of web page- webpage-website-web server-work flow model. HTML5- History-Tags-Attributes-element-Basic tags –Formatting tags- Color coding
| |
Unit-1 |
Teaching Hours:7 |
HTML FORMS
|
|
List – Images- Hyperlink-Table-Header-Introduction to advanced tags-input tags-forms-style-buttons-image-video | |
Unit-1 |
Teaching Hours:7 |
Web Programming Introduction
|
|
Web technology terminology-Structure of web page- webpage-website-web server-work flow model. HTML5- History-Tags-Attributes-element-Basic tags –Formatting tags- Color coding
| |
Unit-1 |
Teaching Hours:7 |
HTML FORMS
|
|
List – Images- Hyperlink-Table-Header-Introduction to advanced tags-input tags-forms-style-buttons-image-video | |
Unit-2 |
Teaching Hours:12 |
CSS Introduction
|
|
Cascading style sheet –Benefits –CSS version history-Syntax-External-internal-inline-single style-multiple style-value lengths and percentage-ID selector –Class Selector-group Selector – universal selector- Color-background-cursor-list-Box model-display positioning-floats
| |
Unit-2 |
Teaching Hours:12 |
JavaScript Fundamentals
|
|
Introduction to JavaScript-Client side-Server side-Advantages-limitations-Syntax-whitespace-line breaks-case sensitivity-comments-enabling in web browsers-placement-variables-executing first program-Data types –variables-scope-operators-if –else-switch-loops-function-events | |
Unit-2 |
Teaching Hours:12 |
CSS Introduction
|
|
Cascading style sheet –Benefits –CSS version history-Syntax-External-internal-inline-single style-multiple style-value lengths and percentage-ID selector –Class Selector-group Selector – universal selector- Color-background-cursor-list-Box model-display positioning-floats
| |
Unit-2 |
Teaching Hours:12 |
JavaScript Fundamentals
|
|
Introduction to JavaScript-Client side-Server side-Advantages-limitations-Syntax-whitespace-line breaks-case sensitivity-comments-enabling in web browsers-placement-variables-executing first program-Data types –variables-scope-operators-if –else-switch-loops-function-events | |
Unit-3 |
Teaching Hours:9 |
JavaScript Advanced
|
|
Event Handling-onclick-onsubmit-onmouseover-onmouseout-HTML 5 standard events-cookies-how it works-storing cookies-page redirect-page printing-JS objects-Boolean-string
| |
Unit-3 |
Teaching Hours:9 |
JavaScript Advanced
|
|
Event Handling-onclick-onsubmit-onmouseover-onmouseout-HTML 5 standard events-cookies-how it works-storing cookies-page redirect-page printing-JS objects-Boolean-string
| |
Unit-4 |
Teaching Hours:10 |
PHP SCRIPTING
|
|
PHP syntax and variables, Operators and Expressions, Conditional Branching and Looping Statements - Essentials of PHP- Installation of Web Server, XAMPP Configurations-PHP Forms- GET and POST method | |
Unit-4 |
Teaching Hours:10 |
PHP SCRIPTING
|
|
PHP syntax and variables, Operators and Expressions, Conditional Branching and Looping Statements - Essentials of PHP- Installation of Web Server, XAMPP Configurations-PHP Forms- GET and POST method | |
Unit-5 |
Teaching Hours:7 |
Instant Design
|
|
Create website using Instant Design tool-Create website using WIX/Webflow/Google Site-Creating responsive web pages | |
Unit-5 |
Teaching Hours:7 |
Testing and hosting
|
|
Sandboxing-Testing the website-cross platform browser compatibility check up. Templates usage (case study) | |
Unit-5 |
Teaching Hours:7 |
Instant Design
|
|
Create website using Instant Design tool-Create website using WIX/Webflow/Google Site-Creating responsive web pages | |
Unit-5 |
Teaching Hours:7 |
Testing and hosting
|
|
Sandboxing-Testing the website-cross platform browser compatibility check up. Templates usage (case study) | |
Text Books And Reference Books: [1] Rachel Andrew, Jeremy Keith, “HTML5 for Web Designers”, Second Edition, 2nd Edition, 2016, ISBN: 9781492017899, Publisher - A Book Apart. [2] CSS3 in easy steps”, Mike McGrath, publisher: In Easy Steps, ISBN: 9781840785418, 1840785411 [3] Jeremy McPeak and Paul Wilton, “Beginning JavaScript”, Wrox publication, | |
Essential Reading / Recommended Reading [1] Faithe Wempen, Microsoft,” Start Here! Learn HTML5" , 2012 [2] David McFarland, O’REILLY , “CSS 3 Missing Manual”, 2nd edition , 2014 | |
Evaluation Pattern CIA-50% ESE-50% | |
CSC542C - MOBILE APPLICATIONS (2022 Batch) | |
Total Teaching Hours for Semester:45 |
No of Lecture Hours/Week:3 |
Max Marks:100 |
Credits:3 |
Course Objectives/Course Description |
|
This course focuses on developing applications for modern Smartphone operating systems. Most of the course is dedicated to Google's Android. Rapid application development techniques are covered, as well as setup of the development environment, real-world testing, and deployment. |
|
Learning Outcome |
|
CO1: Install and configure Android application development tools. CO2: Design and develop user Interfaces for the Android Application CO3: Develop and Deploy Android Applications using Multimedia Concepts |
Unit-1 |
Teaching Hours:10 |
Overview
|
|
A little background about mobile technologies, Different mobile technologies – Android, Windows, IOS, Black Berry, series 40, Bada, Benefits and drawbacks of Smartphone programming, Overview of Android, How it all got started, Why Android different and important, Android Stack overview, Linux kernel, native libraries, App framework, Apps, SDK overview, platforms, tools, versions. Creating and setting up custom Android emulator. | |
Unit-1 |
Teaching Hours:10 |
Overview
|
|
A little background about mobile technologies, Different mobile technologies – Android, Windows, IOS, Black Berry, series 40, Bada, Benefits and drawbacks of Smartphone programming, Overview of Android, How it all got started, Why Android different and important, Android Stack overview, Linux kernel, native libraries, App framework, Apps, SDK overview, platforms, tools, versions. Creating and setting up custom Android emulator. | |
Unit-2 |
Teaching Hours:8 |
Introduction to Android
|
|
Install the android SDK, Install base tools, install SDKs and Add-ons, Install apache Ant, Emulator, and Device. Get know Eclipse, Build , install and Run the Application in your Emulator or Device, Project Structure. | |
Unit-2 |
Teaching Hours:8 |
Introduction to Android
|
|
Install the android SDK, Install base tools, install SDKs and Add-ons, Install apache Ant, Emulator, and Device. Get know Eclipse, Build , install and Run the Application in your Emulator or Device, Project Structure. | |
Unit-3 |
Teaching Hours:12 |
Designing User interface
|
|
Designing by declaration, creating the opening screen, using alternate resources, implementing an about box, applying a theme, adding a menu, adding settings, debugging with log messages, debugging with debugger. | |
Unit-3 |
Teaching Hours:12 |
Designing User interface
|
|
Designing by declaration, creating the opening screen, using alternate resources, implementing an about box, applying a theme, adding a menu, adding settings, debugging with log messages, debugging with debugger. | |
Unit-4 |
Teaching Hours:8 |
Exploring 2D graphics and Multimedia
|
|
Learning the basics, adding Graphics to existing apps, handling input, learn to change the final improvements, Playing audio, Playing Video, Adding sound to existing app, | |
Unit-4 |
Teaching Hours:8 |
Exploring 2D graphics and Multimedia
|
|
Learning the basics, adding Graphics to existing apps, handling input, learn to change the final improvements, Playing audio, Playing Video, Adding sound to existing app, | |
Unit-5 |
Teaching Hours:7 |
Storing local Data
|
|
Reading/writing local data, Accessing the Internal File system, Accessing SD card.
| |
Unit-5 |
Teaching Hours:7 |
Storing local Data
|
|
Reading/writing local data, Accessing the Internal File system, Accessing SD card.
| |
Text Books And Reference Books:
| |
Essential Reading / Recommended Reading
Pragmatic. Bookshelf (2009), ISBN-13: 978-1934356173. 2. Jerome (J.F) DiMarzio , Android - A programmer's Guide, TataMcgraw Hill, ISBN: 9780071070591, 2010. | |
Evaluation Pattern CIA: 50% ESE: 50% | |
CSC542D - GRAPHICS AND ANIMATION (2022 Batch) | |
Total Teaching Hours for Semester:45 |
No of Lecture Hours/Week:3 |
Max Marks:100 |
Credits:3 |
Course Objectives/Course Description |
|
To acquire knowledge in three-dimensional modelling and animation using 3DS Max software and to render the animated scene effectively using light and material design. |
|
Learning Outcome |
|
CO1: Understand the concept of 2D and 3D. CO2: Construct graphic models in 2D and 3D with lighting effects. CO3: Apply animation on 3D models. |
Unit-1 |
Teaching Hours:9 |
Introducing Objects
|
|
Standard primitives, modelling with modifiers, making clones, working with groups. | |
Unit-1 |
Teaching Hours:9 |
Autodesk 3ds Max
|
|
Introduction, Working, touring the interface, working with objects, and viewing. | |
Unit-1 |
Teaching Hours:9 |
Introducing Objects
|
|
Standard primitives, modelling with modifiers, making clones, working with groups. | |
Unit-1 |
Teaching Hours:9 |
Autodesk 3ds Max
|
|
Introduction, Working, touring the interface, working with objects, and viewing. | |
Unit-2 |
Teaching Hours:9 |
Editing Meshes and Creating and Organizing and Editing Objects
|
|
Creating shapes with Boolean objects, tracing a sketch, editing meshes, create symmetric forms, smoothing meshes. Naming and renaming objects, organizing objects by layer, lofting an object. | |
Unit-2 |
Teaching Hours:9 |
Creating Shapes with Splines
|
|
Drawing with splines, modifying a shape, outlining and extruding splines, combining and extruding primitive splines, creating a solid form with splines. | |
Unit-2 |
Teaching Hours:9 |
Editing Meshes and Creating and Organizing and Editing Objects
|
|
Creating shapes with Boolean objects, tracing a sketch, editing meshes, create symmetric forms, smoothing meshes. Naming and renaming objects, organizing objects by layer, lofting an object. | |
Unit-2 |
Teaching Hours:9 |
Creating Shapes with Splines
|
|
Drawing with splines, modifying a shape, outlining and extruding splines, combining and extruding primitive splines, creating a solid form with splines. | |
Unit-3 |
Teaching Hours:9 |
Light and Shadow
|
|
Lighting the model, rendering a view, ambient light, adding shadow effects, playing in the shadows, using the light listener, using scene states. | |
Unit-3 |
Teaching Hours:9 |
Enhancing Models with Materials
|
|
Texture maps, adding materials to object, editing materials, using the standard material, assigning materials to parts of an object. | |
Unit-3 |
Teaching Hours:9 |
Light and Shadow
|
|
Lighting the model, rendering a view, ambient light, adding shadow effects, playing in the shadows, using the light listener, using scene states. | |
Unit-3 |
Teaching Hours:9 |
Enhancing Models with Materials
|
|
Texture maps, adding materials to object, editing materials, using the standard material, assigning materials to parts of an object. | |
Unit-4 |
Teaching Hours:9 |
Using the Camera
|
|
Basics of 3ds max camera, setting up an interior view, creating an environment, using immersive environment for animation, using render type and elements, matching your scene to background image. | |
Unit-4 |
Teaching Hours:9 |
Organizing Objects and Scene Management
|
|
Gaining access, arranging furniture, replacing objects, using the rendered framework window. | |
Unit-4 |
Teaching Hours:9 |
Using the Camera
|
|
Basics of 3ds max camera, setting up an interior view, creating an environment, using immersive environment for animation, using render type and elements, matching your scene to background image. | |
Unit-4 |
Teaching Hours:9 |
Organizing Objects and Scene Management
|
|
Gaining access, arranging furniture, replacing objects, using the rendered framework window. | |
Unit-5 |
Teaching Hours:9 |
Animation
|
|
The world of video, Time, creating a quick study animation, key frames, increasing and editing key frames, adding more frames, moving the camera target over time, controlling lights over time. | |
Unit-5 |
Teaching Hours:9 |
Animation
|
|
The world of video, Time, creating a quick study animation, key frames, increasing and editing key frames, adding more frames, moving the camera target over time, controlling lights over time. | |
Text Books And Reference Books: [1] J. Harper, Mastering Autodesk 3ds Max 2013. Sybex, 2012. | |
Essential Reading / Recommended Reading [1] R. L. Derakhshani and D. Derakhshani, Autodesk 3ds Max Essential. Sybex, 2011. [2] K. L. Murdock, 3ds Max 2012 Bible. Wiley, 2011. [3] T. Mullen, Introducing Character Animation with Blender. Sybex, 2007. | |
Evaluation Pattern CIA: 50% ESE: 50% | |
CSC542E - .NET TECHNOLOGY (2022 Batch) | |
Total Teaching Hours for Semester:45 |
No of Lecture Hours/Week:3 |
Max Marks:100 |
Credits:3 |
Course Objectives/Course Description |
|
The course gives introduction to the .Net framework. It also enable the studentst to learn and develop console, windows and web based application in the .NET framework using C# programming. |
|
Learning Outcome |
|
CO1: Design and implement robust console applications that leverage core object-oriented programming (OOP) principles such as encapsulation, inheritance, polymorphism, and abstraction. CO2: Apply error handling, debugging techniques, and file I/O operations in the development of console applications. CO3: Design and build interactive window-based applications using OOP principles and frameworks like Windows Forms, including the implementation of event-driven programming. |
Unit-1 |
Teaching Hours:10 |
Introduction
|
|
Vision and goals of .NET, Building blocks of .Net, Overview of .Net applications, .Net evolution, The .Net Framework Architecture, Intermediate Language(IL), Common Language Runtime (CLR), JIT Compilation, Common Type System(CTS), Common Language System (CLS), Assemblies, IL Disassembler (ILdasm.exe), Namespaces. C# features Working with methods- understanding method structure, calling a method, understanding parameter types, overloading methods, virtual methods, overriding methods. | |
Unit-1 |
Teaching Hours:10 |
Introduction
|
|
Vision and goals of .NET, Building blocks of .Net, Overview of .Net applications, .Net evolution, The .Net Framework Architecture, Intermediate Language(IL), Common Language Runtime (CLR), JIT Compilation, Common Type System(CTS), Common Language System (CLS), Assemblies, IL Disassembler (ILdasm.exe), Namespaces. C# features Working with methods- understanding method structure, calling a method, understanding parameter types, overloading methods, virtual methods, overriding methods. | |
Unit-2 |
Teaching Hours:10 |
C# classes
|
|
Constants, fields, methods, properties, events, indexers, operators, constructors, destructors, static modifiers. Compiling with multiple classes, virtual and override methods, abstract methods, sealed classes, Boxing and Unboxing,Working with namespaces, Understanding interfaces, handling exceptions. Self Learning: Class Inheritance | |
Unit-2 |
Teaching Hours:10 |
C# classes
|
|
Constants, fields, methods, properties, events, indexers, operators, constructors, destructors, static modifiers. Compiling with multiple classes, virtual and override methods, abstract methods, sealed classes, Boxing and Unboxing,Working with namespaces, Understanding interfaces, handling exceptions. Self Learning: Class Inheritance | |
Unit-3 |
Teaching Hours:9 |
Windows Applications
|
|
Understanding Windows Forms Architecture, Windows controls: Common, Containers, Menus and Tool strips, Data, Reporting. Adding and using windows controls to the form. | |
Unit-3 |
Teaching Hours:9 |
Windows Applications
|
|
Understanding Windows Forms Architecture, Windows controls: Common, Containers, Menus and Tool strips, Data, Reporting. Adding and using windows controls to the form. | |
Unit-4 |
Teaching Hours:8 |
Database programming with ADO.NET
|
|
Understanding the Dataset classes and their relatives, Understanding OLEDB and SQL Server Support, Understanding common database operations using ADO.NET–Operations that don’t return rows, Data operations that return single row entities, data operations that affect single-row entities, data operations returning sets of rows, data operations affecting sets of rows, operations that return hierarchical data. | |
Unit-4 |
Teaching Hours:8 |
Database programming with ADO.NET
|
|
Understanding the Dataset classes and their relatives, Understanding OLEDB and SQL Server Support, Understanding common database operations using ADO.NET–Operations that don’t return rows, Data operations that return single row entities, data operations that affect single-row entities, data operations returning sets of rows, data operations affecting sets of rows, operations that return hierarchical data. | |
Unit-5 |
Teaching Hours:8 |
ASP.NET
|
|
Creating web applications with webforms [ASP.NET], Difference between ASP and ASP.NET, Defining a web application, ASP.NET architecture, ASP.NET webforms, Code behind model, Validation controls in ASP.NET, Server controls and data binding, Grid view, data repeater, data list, Data binding in ASP.NET, Data source controls-sql data source, Data controls–gridview and details view, Login controls. | |
Unit-5 |
Teaching Hours:8 |
ASP.NET
|
|
Creating web applications with webforms [ASP.NET], Difference between ASP and ASP.NET, Defining a web application, ASP.NET architecture, ASP.NET webforms, Code behind model, Validation controls in ASP.NET, Server controls and data binding, Grid view, data repeater, data list, Data binding in ASP.NET, Data source controls-sql data source, Data controls–gridview and details view, Login controls. | |
Text Books And Reference Books:
[1] JeffFerguson, BrianPatterson, Jason Beres ,C# Programming Bible ,Wiley Publishing Inc., Reprint 2006. | |
Essential Reading / Recommended Reading
[1] JeffProsise, Programming .Net, 2nd Edition, WP Publishers & Distributors Pvt.Ltd, 2009. [2] Kevin Hoffman & Jeff Gabriel, Professional .Net Framework, 1stEdition, Wrox PressPublishers,2006. | |
Evaluation Pattern CIA - 50% | |
CSC551A - DATA ANALYTICS LAB (2022 Batch) | |
Total Teaching Hours for Semester:30 |
No of Lecture Hours/Week:2 |
Max Marks:50 |
Credits:2 |
Course Objectives/Course Description |
|
This course is to help students to do hands-on lab experience by practicing data analytics to get the insights from the chosen area/domain based on the given topics. |
|
Learning Outcome |
|
CO1: Demonstrate the Correlation and Regression methods. CO2: Design different forecasting models. CO3: Analyse data classification and clustering based on different methods.
|
Unit-1 |
Teaching Hours:30 |
List of programs
|
|
| |
Unit-1 |
Teaching Hours:30 |
List of programs
|
|
| |
Text Books And Reference Books:
| |
Essential Reading / Recommended Reading
| |
Evaluation Pattern CIA - 50% ESE - 50% | |
CSC551B - INTERNET OF THINGS LAB (2022 Batch) | |
Total Teaching Hours for Semester:45 |
No of Lecture Hours/Week:3 |
Max Marks:100 |
Credits:3 |
Course Objectives/Course Description |
|
To explore students to the world of interconnected devices, communication among these connected devices, transfer of data and further analysis of this data to make appropriate decisions |
|
Learning Outcome |
|
CO1: Analyze the functional blocks involved in Internet of Things. CO2: Understand the architecture of Internet of Things. CO3: Infer the process of analysing data in Internet of Things. CO4: Demonstrate the application of IoT in real world. |
Unit-1 |
Teaching Hours:9 |
Introduction to Internet of Things
|
|
Introduction, Definition and Characteristics of IoT, Physical Design of IoT, Things in IoT, IoT Protocols, Logical Design of IoT, IoT Functional Blocks, IoT Communication Models, IoT Communications APIs, IoT Enabling Technologies, Wireless Sensor Networks, Cloud Computing, Big Data Analytics, Communication Protocols, Embedded Systems. | |
Unit-1 |
Teaching Hours:9 |
Introduction to Internet of Things
|
|
Introduction, Definition and Characteristics of IoT, Physical Design of IoT, Things in IoT, IoT Protocols, Logical Design of IoT, IoT Functional Blocks, IoT Communication Models, IoT Communications APIs, IoT Enabling Technologies, Wireless Sensor Networks, Cloud Computing, Big Data Analytics, Communication Protocols, Embedded Systems. | |
Unit-2 |
Teaching Hours:9 |
IoT Physical Devices and EndPoints
|
|
What is an IoT Device, Exemplary Device: Raspberry Pi, About the Board, Linux on Raspberry Pi, Raspberry Pi interfaces, Programming Raspberry Pi with Python. Other IoT Devices – pcDuino, BeagleBone Black, Cubieboard. | |
Unit-2 |
Teaching Hours:9 |
IoT Physical Devices and EndPoints
|
|
What is an IoT Device, Exemplary Device: Raspberry Pi, About the Board, Linux on Raspberry Pi, Raspberry Pi interfaces, Programming Raspberry Pi with Python. Other IoT Devices – pcDuino, BeagleBone Black, Cubieboard. | |
Unit-3 |
Teaching Hours:9 |
Domain Specific IoTs and M2M
|
|
Home Automation, Cities, Environment, Energy, Retail, Logistics, Agriculture, Industry, Health & Lifestyle. IoT and M2M – Introduction, M2M, Difference between IoT and M2M, SDN and NFV for IoT. | |
Unit-3 |
Teaching Hours:9 |
Domain Specific IoTs and M2M
|
|
Home Automation, Cities, Environment, Energy, Retail, Logistics, Agriculture, Industry, Health & Lifestyle. IoT and M2M – Introduction, M2M, Difference between IoT and M2M, SDN and NFV for IoT. | |
Unit-4 |
Teaching Hours:9 |
Arduino Programming
|
|
The Arduino Ecosystem, Installing the software, Connecting the Arduino, Opening a sketch, Sketching in code, The Structure of Arduino C, Verifying and Uploading, Working with variables, Making Decisions, Digital Ins and Outs, Analog In, Analog Out. | |
Unit-4 |
Teaching Hours:9 |
Arduino Programming
|
|
The Arduino Ecosystem, Installing the software, Connecting the Arduino, Opening a sketch, Sketching in code, The Structure of Arduino C, Verifying and Uploading, Working with variables, Making Decisions, Digital Ins and Outs, Analog In, Analog Out. | |
Unit-5 |
Teaching Hours:9 |
Infrastructure and Service Discovery Protocols for the IoT Ecosystem
|
|
Infrastructure Protocols: Routing Protocol, IEEE 802.15.4, Bluetooth Low Energy, Z-Wave, ZigBee. Protocols for IoT Service Discovery: multicast Domain Name System (mDNS), DNS Service Discovery, Universal Plug and Play. Prominent IoT Service Discovery Products available in the market. | |
Unit-5 |
Teaching Hours:9 |
Infrastructure and Service Discovery Protocols for the IoT Ecosystem
|
|
Infrastructure Protocols: Routing Protocol, IEEE 802.15.4, Bluetooth Low Energy, Z-Wave, ZigBee. Protocols for IoT Service Discovery: multicast Domain Name System (mDNS), DNS Service Discovery, Universal Plug and Play. Prominent IoT Service Discovery Products available in the market. | |
Text Books And Reference Books: [1] Arshdeep Bahga and Vijay Madisetti , "Internet of Things: A Hands-on Approach", Universities Press, 2015 [2] Pethuru Raj and Anupama C. Raman , “The Internet of Things: Enabling Technologies, Platforms, and Use Cases", CRC Press, 2017. [3] Brian Evans, Beginning Arduino Programming, Apress, 2011 | |
Essential Reading / Recommended Reading [1] March Schwartz, “Internet of Things with Arduino Cookbook”, Packt Publishing, 2016 [2] Olivier Hersent , David Boswarthick, Omar Elloumi , “The Internet of Things – Key applications and Protocols”, Wiley, 2012. [3]Peter Waher, “Mastering Internet of Things: Design and create your own IoT applications using Raspberry Pi 3”, Packt Publishing, 2018 | |
Evaluation Pattern CIA 50% ESE 50% | |
CSC551C - DIGITAL IMAGE PROCESSING LAB (2022 Batch) | |
Total Teaching Hours for Semester:30 |
No of Lecture Hours/Week:2 |
Max Marks:50 |
Credits:2 |
Course Objectives/Course Description |
|
This course helps student to understand image enhancement techniques in spatial domain.This also focuses on classification of images using Matlab |
|
Learning Outcome |
|
CO1: Understand the enhancement techniques of images. CO2: Analyse different filtering methods in Spatial domain.
|
Unit-1 |
Teaching Hours:30 |
List of programs
|
|
1. Write a program to display frequency of each pixel occurring in a row of an image. 2. Write a program to convert color images to Gray scaleImages. 3. Write a program to perform Rotation of images using differentmethods. 4. Write a program to perform resizing of images using differentmethods. 5. Write a program to implement Contraststretching 6. Write a program to demonstrate smoothening of animage 7. Write a program to perform non-linear filtering of animage(Median) 8. Write a program to implement of Edgedetection 9. Write a program to extract the three color components in theimages 10. Write a program to perform bit planeslicing. | |
Unit-1 |
Teaching Hours:30 |
List of programs
|
|
1. Write a program to display frequency of each pixel occurring in a row of an image. 2. Write a program to convert color images to Gray scaleImages. 3. Write a program to perform Rotation of images using differentmethods. 4. Write a program to perform resizing of images using differentmethods. 5. Write a program to implement Contraststretching 6. Write a program to demonstrate smoothening of animage 7. Write a program to perform non-linear filtering of animage(Median) 8. Write a program to implement of Edgedetection 9. Write a program to extract the three color components in theimages 10. Write a program to perform bit planeslicing. | |
Text Books And Reference Books: - | |
Essential Reading / Recommended Reading - | |
Evaluation Pattern CIA 50% ESE 50% | |
CSC551D - BUSINESS INTELLIGENCE LAB (2022 Batch) | |
Total Teaching Hours for Semester:30 |
No of Lecture Hours/Week:2 |
Max Marks:50 |
Credits:2 |
Course Objectives/Course Description |
|
This course is designed to introduce a concept of Business Intelligence for better business decision. Also gives practical knowledge on implementation of Business Intelligence concepts. |
|
Learning Outcome |
|
CO1: Explore various modeling techniques and business intelligence methods to various situations using data mining tools. CO2: Demonstrate the impact of business reporting, information visualization, and dashboards using BI tools. |
Unit-1 |
Teaching Hours:30 |
Programs
|
|
1. Practice various data access methods. Representation formats: CSV, FLV, ARFF, XML. 2. Implement data conversion. eg. CSV2ARFF file format conversion in Java. 3. Configuring and testing the ETL tools. 4. Implement pipeline, sampling. 5. Implement surrogate keys and change in dimensions. 6. Practice data source views, dimensions, hierarchies. 7. Implement OLAP explorative data analysis with Pivot Tables. 8. Implement the metrics. 9. Implement Parent-child hierarchies. ROLAP and MOLAP. 10. Implement SQL reporting services. | |
Unit-1 |
Teaching Hours:30 |
Programs
|
|
1. Practice various data access methods. Representation formats: CSV, FLV, ARFF, XML. 2. Implement data conversion. eg. CSV2ARFF file format conversion in Java. 3. Configuring and testing the ETL tools. 4. Implement pipeline, sampling. 5. Implement surrogate keys and change in dimensions. 6. Practice data source views, dimensions, hierarchies. 7. Implement OLAP explorative data analysis with Pivot Tables. 8. Implement the metrics. 9. Implement Parent-child hierarchies. ROLAP and MOLAP. 10. Implement SQL reporting services. | |
Text Books And Reference Books: - | |
Essential Reading / Recommended Reading - | |
Evaluation Pattern CIA - 50% ESE- 50% | |
CSC552A - UNIX OPERATING SYSTEM LAB (2022 Batch) | |
Total Teaching Hours for Semester:45 |
No of Lecture Hours/Week:3 |
Max Marks:100 |
Credits:3 |
Course Objectives/Course Description |
|
UNIX is a multi user and multi-tasking operating system. After learning the concepts of an operating system, it is appropriate to learn how UNIX implements these concepts. The subject is introduced with the features and architecture of UNIX. The file system, Process management and Memory management are discussed to make the students understand the internals of UNIX. Various commands used by UNIX shell is also discussed which makes the users of UNIX comfortable to interact with each other. Bourne shell programming is dealt in depth which can be used to develop applications in UNIX. |
|
Learning Outcome |
|
CO1: Describe the architecture and features of UNIX Operating System and distinguish it from other Operating System CO2: Apply and change the ownership and file permissions using advance Unix commands. CO3: Build Regular expression to perform pattern matching using utilities like grep, sed and awk. CO4: Implement shell scripts for real time applications.
|
Unit-1 |
Teaching Hours:8 |
Introduction to UNIX
|
|
Evolution of UNIX – UNIX System Structure – Features of Unix - Operating System Services - Unix Kernel - Locating Commands, Internal and External Commands, Flexibility of Command Usage, man: Browsing and Manual Pages On-line, Understanding the man Documentation. General Purpose Utilities: cal, date, echo, printf, echo, bc, script, passwd, who, uname, tty, stty. | |
Unit-1 |
Teaching Hours:8 |
Introduction to UNIX
|
|
Evolution of UNIX – UNIX System Structure – Features of Unix - Operating System Services - Unix Kernel - Locating Commands, Internal and External Commands, Flexibility of Command Usage, man: Browsing and Manual Pages On-line, Understanding the man Documentation. General Purpose Utilities: cal, date, echo, printf, echo, bc, script, passwd, who, uname, tty, stty. | |
Unit-2 |
Teaching Hours:9 |
The UNIX file system
|
|
The File, I-nodes – Structure of a regular file. The HOME Variable: The Home Directory, Directory related commands: pwd, mkdir, cd, rmdir. Absolute and relative path names. The UNIX File System. File manipulation commands: cat, cp, rm, mv, more, The lp Subsystem: Printing a File, file, wc, Words and Characters, od, The spell and ispell, cmp, comm, diff. File compression commands: gzip, gunzip, tar, zip, unzip. Basic file attributes: The –d Option: Listing Directory Attributes, File Ownership, File Permissions, chmod: Changing File Permissions, Directory Permissions, Changing File Ownership. Hard links, Symbolic Links, ln, umask, and find. | |
Unit-2 |
Teaching Hours:9 |
The UNIX file system
|
|
The File, I-nodes – Structure of a regular file. The HOME Variable: The Home Directory, Directory related commands: pwd, mkdir, cd, rmdir. Absolute and relative path names. The UNIX File System. File manipulation commands: cat, cp, rm, mv, more, The lp Subsystem: Printing a File, file, wc, Words and Characters, od, The spell and ispell, cmp, comm, diff. File compression commands: gzip, gunzip, tar, zip, unzip. Basic file attributes: The –d Option: Listing Directory Attributes, File Ownership, File Permissions, chmod: Changing File Permissions, Directory Permissions, Changing File Ownership. Hard links, Symbolic Links, ln, umask, and find. | |
Unit-3 |
Teaching Hours:9 |
UNIX process management
|
|
Process Basics, Process States and Transitions, ps: Process Status, System Processes (-e or –a), Internal and External Commands, Running Jobs in Background, nice: Job Execution With Low Priority, Killing Processes with Signals, Job Control, at and batch: Execute Later, cron: Running Jobs Periodically, time: Timing Processes. PID and PPID. | |
Unit-3 |
Teaching Hours:9 |
UNIX process management
|
|
Process Basics, Process States and Transitions, ps: Process Status, System Processes (-e or –a), Internal and External Commands, Running Jobs in Background, nice: Job Execution With Low Priority, Killing Processes with Signals, Job Control, at and batch: Execute Later, cron: Running Jobs Periodically, time: Timing Processes. PID and PPID. | |
Unit-4 |
Teaching Hours:9 |
Filters and communication simple filters
|
|
The Sample Database, pr: Paginating Files, head: Displaying the Beginning of a File, tail: Displaying the End of a File, cut: Slitting a File Vertically, paste: Pasting Files, sort: Ordering a File, uniq: Locate Repeated and Non repeated Lines, tr: Translating Characters, An Example: Displaying a Word-count List. Filters using regular expressions: grep: Searching for a Pattern, and egrep. Communication: Communicating with Other Users: Who, Mail, Wall, Send, Mesg, Ftp. | |
Unit-4 |
Teaching Hours:9 |
Filters and communication simple filters
|
|
The Sample Database, pr: Paginating Files, head: Displaying the Beginning of a File, tail: Displaying the End of a File, cut: Slitting a File Vertically, paste: Pasting Files, sort: Ordering a File, uniq: Locate Repeated and Non repeated Lines, tr: Translating Characters, An Example: Displaying a Word-count List. Filters using regular expressions: grep: Searching for a Pattern, and egrep. Communication: Communicating with Other Users: Who, Mail, Wall, Send, Mesg, Ftp. | |
Unit-5 |
Teaching Hours:10 |
UNIX shell environment
|
|
The Wild-cards, Escaping and Quoting, Redirection; Review of vi Operations – Different Modes – Saving and Exiting - Accessing Multiple Files - Interacting with Unix - Miscellaneous Commands - Alphabetical List of Keys. Shell variables - Shell Keywords - Positional parameters - Passing command line arguments. Arithmetic in shell scripts - Read and Echo - Control Structures - if-then-fi - if-then-else-fi - Nested if - Case control structure – Loops - while-until –for - break and continue. Shell meta characters - Exporting variables - User defined Functions. | |
Unit-5 |
Teaching Hours:10 |
UNIX shell environment
|
|
The Wild-cards, Escaping and Quoting, Redirection; Review of vi Operations – Different Modes – Saving and Exiting - Accessing Multiple Files - Interacting with Unix - Miscellaneous Commands - Alphabetical List of Keys. Shell variables - Shell Keywords - Positional parameters - Passing command line arguments. Arithmetic in shell scripts - Read and Echo - Control Structures - if-then-fi - if-then-else-fi - Nested if - Case control structure – Loops - while-until –for - break and continue. Shell meta characters - Exporting variables - User defined Functions. | |
Text Books And Reference Books:
[1] Sumitabha Das. UNIX Concepts and Applications. 5th Edition, New Delhi: Tata McGraw Hill, 2013. [2] Yashavant P Kanetkar. Unix Shell Programming. New Delhi: BPB Publications, 2012. | |
Essential Reading / Recommended Reading
[1] Maurice J Bach. The Design of Unix Operating System. NewDelhi: Prentice Hall of India Pvt. Ltd, 2012. [2] Paul Love, Joe Merlino, Craig Zimmerman, Jeremy C. Reed, and Paul Weinstein. Beginning UNIX. New Delhi: Wiley Publishing, Inc, (Wrox Publishing) 2007 | |
Evaluation Pattern CIA - 50% ESE - 50% | |
CSC552B - WEB TECHNOLOGY LAB (2022 Batch) | |
Total Teaching Hours for Semester:30 |
No of Lecture Hours/Week:2 |
Max Marks:50 |
Credits:2 |
Course Objectives/Course Description |
|
The Web Technology Lab provides a great opening for those who want to pursue a career in the web development. Student will learn the core concepts of web site design including the wire framing, planning and hosting. This course will help them to create a interactive website with great look and functionality. |
|
Learning Outcome |
|
CO1: Design an interactive website with web tools. CO2: Design webpages with server-side scripting using PHP. CO3: Apply web development techniques like CSS and JavaScript for website design. |
Unit-1 |
Teaching Hours:30 |
List of Programs:
|
|
| |
Unit-1 |
Teaching Hours:30 |
List of Programs:
|
|
| |
Text Books And Reference Books: [1] Rachel Andrew, Jeremy Keith, “HTML5 for Web Designers”, Second Edition, 2nd Edition, 2016, ISBN: 9781492017899, Publisher - A Book Apart. | |
Essential Reading / Recommended Reading [1] Faithe Wempen, Microsoft,” Start Here! Learn HTML5" , 2012 | |
Evaluation Pattern CIA-50% ESE-50% | |
CSC552C - MOBILE APPLICATIONS LAB (2022 Batch) | |
Total Teaching Hours for Semester:30 |
No of Lecture Hours/Week:2 |
Max Marks:50 |
Credits:2 |
Course Objectives/Course Description |
|
This course focuses on developing applications for modern Smartphone operating systems. Most of the course is dedicated to Google's Android. Rapid application development techniques are covered, as well as setup of the development environment, real-world testing, and deployment. |
|
Learning Outcome |
|
CO1: Set up and configure the Android development environment, including Android Studio and SDK tools. CO2: Design and implement Android applications using modern rapid application development techniques, ensuring efficient and effective development processes. CO3: Conduct real-world testing of Android applications to identify and fix bugs, ensuring high performance and usability. |
Unit-1 |
Teaching Hours:30 |
List of programs
|
|
1. Creating “Hello world” Application. 2. Creating an Application that displays message based on the screen orientation. 3. Create an application that displays custom designed Opening Screen. 4. Create a calculator application using basic views. 5. Create a Login page for any application. 6. Create an application to calculate age for a given date of birth using date picker view. 7. Create an image gallery using image view and select picture from that. 8. Create menu in Application. 9. Play an audio, based on the user event. 10. Read/ write the Local data. 11.Learn to deploy android Applications | |
Unit-1 |
Teaching Hours:30 |
List of programs
|
|
1. Creating “Hello world” Application. 2. Creating an Application that displays message based on the screen orientation. 3. Create an application that displays custom designed Opening Screen. 4. Create a calculator application using basic views. 5. Create a Login page for any application. 6. Create an application to calculate age for a given date of birth using date picker view. 7. Create an image gallery using image view and select picture from that. 8. Create menu in Application. 9. Play an audio, based on the user event. 10. Read/ write the Local data. 11.Learn to deploy android Applications | |
Text Books And Reference Books: - | |
Essential Reading / Recommended Reading - | |
Evaluation Pattern CIA: 50% ESE: 50% | |
CSC552D - GRAPHICS AND ANIMATION LAB (2022 Batch) | |
Total Teaching Hours for Semester:60 |
No of Lecture Hours/Week:4 |
Max Marks:50 |
Credits:2 |
Course Objectives/Course Description |
|
To acquire knowledge in three dimensional modelling and animation using 3DS Max software and to render the animated scene effectively using light and material design. |
|
Learning Outcome |
|
CO1: Design real-time 3D objects using 3DS Max CO2: Apply effects to objects using light and material. CO3: Create animated frames on built models. |
Unit-1 |
Teaching Hours:60 |
List of programs
|
|
1. Modelling basic objects using standard primitives. 2. Editing shapes with meshes. 3. Transformations and filling of images. 4. Working with color palette and layers. 5. Enhancing objects with lights and shadow. 6. Enhancing models with materials. 7. Creation of images with special effects. 8. Rendering a Scene with layers in the time line. 9. Keyframe animation. 10. Rendering the animation. | |
Unit-1 |
Teaching Hours:60 |
List of programs
|
|
1. Modelling basic objects using standard primitives. 2. Editing shapes with meshes. 3. Transformations and filling of images. 4. Working with color palette and layers. 5. Enhancing objects with lights and shadow. 6. Enhancing models with materials. 7. Creation of images with special effects. 8. Rendering a Scene with layers in the time line. 9. Keyframe animation. 10. Rendering the animation. | |
Text Books And Reference Books: [1] J. Harper, Mastering Autodesk 3ds Max 2013. Sybex, 2012. | |
Essential Reading / Recommended Reading [1] R. L. Derakhshani and D. Derakhshani, Autodesk 3ds Max Essential. Sybex, 2011. [2] K. L. Murdock, 3ds Max 2012 Bible. Wiley, 2011. [3] T. Mullen, Introducing Character Animation with Blender. Sybex, 2007. | |
Evaluation Pattern CIA: 50% ESE: 50% | |
CSC552E - .NET TECHNOLOGY LAB (2022 Batch) | |
Total Teaching Hours for Semester:30 |
No of Lecture Hours/Week:2 |
Max Marks:50 |
Credits:2 |
Course Objectives/Course Description |
|
Apply the knowledge acquired on object oriented programming concepts to develop console, window and web based applications. |
|
Learning Outcome |
|
CO1: Develop dynamic and scalable web applications by integrating OOP with web frameworks such as ASP.NET or Django, along with front-end technologies like HTML, CSS, and JavaScript.
CO2: Design and implement robust console applications that leverage core object-oriented programming (OOP) principles such as encapsulation, inheritance, polymorphism, and abstraction. |
Unit-1 |
Teaching Hours:30 |
List of programs
|
|
| |
Unit-1 |
Teaching Hours:30 |
List of programs
|
|
| |
Text Books And Reference Books: -- | |
Essential Reading / Recommended Reading -- | |
Evaluation Pattern CIA : 50% | |
MAT531 - LINEAR ALGEBRA (2022 Batch) | |
Total Teaching Hours for Semester:45 |
No of Lecture Hours/Week:3 |
Max Marks:100 |
Credits:3 |
Course Objectives/Course Description |
|
Course Description: This course aims at developing the ability to write the mathematical proofs. It helps the students to understand and appreciate the beauty of the abstract nature of mathematics and also to develop a solid foundation of theoretical mathematics. Course Objectives : This course will help the learner to COBJ1. understand the theory of matrices, concepts in vector spaces and Linear Transformations. COBJ2. gain problems solving skills in solving systems of equations using matrices, finding eigenvalues and eigenvectors, vector spaces and linear transformations. |
|
Learning Outcome |
|
CO1: On successful completion of the course, the students should be able to use properties of matrices to solve systems of equations and explore eigenvectors and eigenvalues. CO2: On successful completion of the course, the students should be able to understand the concepts of vector space, basis, dimension, and their properties. CO3: On successful completion of the course, the students should be able to analyse the linear transformations in terms of matrices. |
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Matrices and System of linear equations
|
|||||||||||||||||||||||||||||
Elementary row operations, rank, inverse of a matrix using row operations, Echelon forms, normal forms, system of homogeneous and non-homogeneous equations, Cayley Hamilton theorem, eigenvalues and eigenvectors, diagonalization of square matrices. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Matrices and System of linear equations
|
|||||||||||||||||||||||||||||
Elementary row operations, rank, inverse of a matrix using row operations, Echelon forms, normal forms, system of homogeneous and non-homogeneous equations, Cayley Hamilton theorem, eigenvalues and eigenvectors, diagonalization of square matrices. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Matrices and System of linear equations
|
|||||||||||||||||||||||||||||
Elementary row operations, rank, inverse of a matrix using row operations, Echelon forms, normal forms, system of homogeneous and non-homogeneous equations, Cayley Hamilton theorem, eigenvalues and eigenvectors, diagonalization of square matrices. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Matrices and System of linear equations
|
|||||||||||||||||||||||||||||
Elementary row operations, rank, inverse of a matrix using row operations, Echelon forms, normal forms, system of homogeneous and non-homogeneous equations, Cayley Hamilton theorem, eigenvalues and eigenvectors, diagonalization of square matrices. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Matrices and System of linear equations
|
|||||||||||||||||||||||||||||
Elementary row operations, rank, inverse of a matrix using row operations, Echelon forms, normal forms, system of homogeneous and non-homogeneous equations, Cayley Hamilton theorem, eigenvalues and eigenvectors, diagonalization of square matrices. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Matrices and System of linear equations
|
|||||||||||||||||||||||||||||
Elementary row operations, rank, inverse of a matrix using row operations, Echelon forms, normal forms, system of homogeneous and non-homogeneous equations, Cayley Hamilton theorem, eigenvalues and eigenvectors, diagonalization of square matrices. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Matrices and System of linear equations
|
|||||||||||||||||||||||||||||
Elementary row operations, rank, inverse of a matrix using row operations, Echelon forms, normal forms, system of homogeneous and non-homogeneous equations, Cayley Hamilton theorem, eigenvalues and eigenvectors, diagonalization of square matrices. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Vector Spaces
|
|||||||||||||||||||||||||||||
Vector space-examples and properties, subspaces-criterion for a subset to be a subspace, linear span of a set, linear combination, linear independent and dependent subsets, basis and dimensions, and standard properties. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Vector Spaces
|
|||||||||||||||||||||||||||||
Vector space-examples and properties, subspaces-criterion for a subset to be a subspace, linear span of a set, linear combination, linear independent and dependent subsets, basis and dimensions, and standard properties. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Vector Spaces
|
|||||||||||||||||||||||||||||
Vector space-examples and properties, subspaces-criterion for a subset to be a subspace, linear span of a set, linear combination, linear independent and dependent subsets, basis and dimensions, and standard properties. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Vector Spaces
|
|||||||||||||||||||||||||||||
Vector space-examples and properties, subspaces-criterion for a subset to be a subspace, linear span of a set, linear combination, linear independent and dependent subsets, basis and dimensions, and standard properties. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Vector Spaces
|
|||||||||||||||||||||||||||||
Vector space-examples and properties, subspaces-criterion for a subset to be a subspace, linear span of a set, linear combination, linear independent and dependent subsets, basis and dimensions, and standard properties. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Vector Spaces
|
|||||||||||||||||||||||||||||
Vector space-examples and properties, subspaces-criterion for a subset to be a subspace, linear span of a set, linear combination, linear independent and dependent subsets, basis and dimensions, and standard properties. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Vector Spaces
|
|||||||||||||||||||||||||||||
Vector space-examples and properties, subspaces-criterion for a subset to be a subspace, linear span of a set, linear combination, linear independent and dependent subsets, basis and dimensions, and standard properties. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Linear Transformations
|
|||||||||||||||||||||||||||||
Linear transformations, properties, matrix of a linear transformation, change of basis, range and kernel, rank and nullity, rank-nullity theorem, non-singular linear transformation, eigenvalues and eigenvectors of a linear transformation. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Linear Transformations
|
|||||||||||||||||||||||||||||
Linear transformations, properties, matrix of a linear transformation, change of basis, range and kernel, rank and nullity, rank-nullity theorem, non-singular linear transformation, eigenvalues and eigenvectors of a linear transformation. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Linear Transformations
|
|||||||||||||||||||||||||||||
Linear transformations, properties, matrix of a linear transformation, change of basis, range and kernel, rank and nullity, rank-nullity theorem, non-singular linear transformation, eigenvalues and eigenvectors of a linear transformation. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Linear Transformations
|
|||||||||||||||||||||||||||||
Linear transformations, properties, matrix of a linear transformation, change of basis, range and kernel, rank and nullity, rank-nullity theorem, non-singular linear transformation, eigenvalues and eigenvectors of a linear transformation. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Linear Transformations
|
|||||||||||||||||||||||||||||
Linear transformations, properties, matrix of a linear transformation, change of basis, range and kernel, rank and nullity, rank-nullity theorem, non-singular linear transformation, eigenvalues and eigenvectors of a linear transformation. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Linear Transformations
|
|||||||||||||||||||||||||||||
Linear transformations, properties, matrix of a linear transformation, change of basis, range and kernel, rank and nullity, rank-nullity theorem, non-singular linear transformation, eigenvalues and eigenvectors of a linear transformation. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Linear Transformations
|
|||||||||||||||||||||||||||||
Linear transformations, properties, matrix of a linear transformation, change of basis, range and kernel, rank and nullity, rank-nullity theorem, non-singular linear transformation, eigenvalues and eigenvectors of a linear transformation. | |||||||||||||||||||||||||||||
Text Books And Reference Books: 1. S. Narayan and P.K. Mittal, Text book of Matrices, 10th ed., New Delhi: S Chand and Co. Ltd, 2004. 2. V. Krishnamurthy, V. P. Mainra, and J. L. Arora, An introduction to linear algebra. New Delhi, India: Affiliated East East-West Press Pvt Ltd., 2003. | |||||||||||||||||||||||||||||
Essential Reading / Recommended Reading 1. D. C. Lay, Linear Algebra and its Applications, 3rd ed., Indian Reprint, Pearson Education Asia, 2007. 2. S. Lang, Introduction to Linear Algebra, 2nd ed., New York: Springer-Verlag, 2005. 3. S. H. Friedberg, A. Insel, and L. Spence, Linear algebra, 4th ed., Pearson, 2015. 4. Gilbert Strang, Linear Algebra and its Applications, 4th ed., Thomson Brooks/Cole, 2007. 5. K. Hoffmann and R. A. Kunze, Linear algebra, 2nd ed., PHI Learning, 2014. | |||||||||||||||||||||||||||||
Evaluation Pattern
| |||||||||||||||||||||||||||||
MAT541A - INTEGRAL TRANSFORMS (2022 Batch) | |||||||||||||||||||||||||||||
Total Teaching Hours for Semester:45 |
No of Lecture Hours/Week:3 |
||||||||||||||||||||||||||||
Max Marks:100 |
Credits:3 |
||||||||||||||||||||||||||||
Course Objectives/Course Description |
|||||||||||||||||||||||||||||
Course Description: This course aims at providing a solid foundation upon the fundamental theories on Fourier and Laplace transforms. Course objectives: This course will help the learner to
COBJ1. gain familiarity in fundamental theories of the Fourier series, Fourier Integrals, Fourier and Laplace transforms. |
|||||||||||||||||||||||||||||
Learning Outcome |
|||||||||||||||||||||||||||||
CO1.: On successful completion of the course, the students should be able to evaluate integrals by using Fourier series and Fourier integrals. CO2.: On successful completion of the course, the students should be able to apply Fourier sine and cosine transforms for various functions. CO3.: On successful completion of the course, the students should be able to derive Laplace transforms of different types of functions. CO4.: On successful completion of the course, the students should be able to utilize the properties of Laplace transforms in solving ordinary differential equations. |
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Fourier series and Fourier transform
|
|||||||||||||||||||||||||||||
Fourier series and Fourier transform of some common functions. The Fourier integral, complex Fourier transforms, basic properties, transform of the derivative, convolution theorem, and Parseval’s identity. The applications of Fourier transform to ordinary differential equations. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Fourier series and Fourier transform
|
|||||||||||||||||||||||||||||
Fourier series and Fourier transform of some common functions. The Fourier integral, complex Fourier transforms, basic properties, transform of the derivative, convolution theorem, and Parseval’s identity. The applications of Fourier transform to ordinary differential equations. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Fourier series and Fourier transform
|
|||||||||||||||||||||||||||||
Fourier series and Fourier transform of some common functions. The Fourier integral, complex Fourier transforms, basic properties, transform of the derivative, convolution theorem, and Parseval’s identity. The applications of Fourier transform to ordinary differential equations. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Fourier series and Fourier transform
|
|||||||||||||||||||||||||||||
Fourier series and Fourier transform of some common functions. The Fourier integral, complex Fourier transforms, basic properties, transform of the derivative, convolution theorem, and Parseval’s identity. The applications of Fourier transform to ordinary differential equations. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Fourier series and Fourier transform
|
|||||||||||||||||||||||||||||
Fourier series and Fourier transform of some common functions. The Fourier integral, complex Fourier transforms, basic properties, transform of the derivative, convolution theorem, and Parseval’s identity. The applications of Fourier transform to ordinary differential equations. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Fourier sine and cosine transforms
|
|||||||||||||||||||||||||||||
Fourier cosine and sine transforms with examples, properties of Fourier Cosine and Sine Transforms, applications of Fourier sine and cosine transforms with examples. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Fourier sine and cosine transforms
|
|||||||||||||||||||||||||||||
Fourier cosine and sine transforms with examples, properties of Fourier Cosine and Sine Transforms, applications of Fourier sine and cosine transforms with examples. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Fourier sine and cosine transforms
|
|||||||||||||||||||||||||||||
Fourier cosine and sine transforms with examples, properties of Fourier Cosine and Sine Transforms, applications of Fourier sine and cosine transforms with examples. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Fourier sine and cosine transforms
|
|||||||||||||||||||||||||||||
Fourier cosine and sine transforms with examples, properties of Fourier Cosine and Sine Transforms, applications of Fourier sine and cosine transforms with examples. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Fourier sine and cosine transforms
|
|||||||||||||||||||||||||||||
Fourier cosine and sine transforms with examples, properties of Fourier Cosine and Sine Transforms, applications of Fourier sine and cosine transforms with examples. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Laplace transform
|
|||||||||||||||||||||||||||||
Laplace Transform of standard functions, Laplace transform of periodic functions, Inverse Laplace transform, solution of ordinary differential equation with constant coefficient using Laplace transform, solution of simultaneous Ordinary differential equations. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Laplace transform
|
|||||||||||||||||||||||||||||
Laplace Transform of standard functions, Laplace transform of periodic functions, Inverse Laplace transform, solution of ordinary differential equation with constant coefficient using Laplace transform, solution of simultaneous Ordinary differential equations. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Laplace transform
|
|||||||||||||||||||||||||||||
Laplace Transform of standard functions, Laplace transform of periodic functions, Inverse Laplace transform, solution of ordinary differential equation with constant coefficient using Laplace transform, solution of simultaneous Ordinary differential equations. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Laplace transform
|
|||||||||||||||||||||||||||||
Laplace Transform of standard functions, Laplace transform of periodic functions, Inverse Laplace transform, solution of ordinary differential equation with constant coefficient using Laplace transform, solution of simultaneous Ordinary differential equations. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Laplace transform
|
|||||||||||||||||||||||||||||
Laplace Transform of standard functions, Laplace transform of periodic functions, Inverse Laplace transform, solution of ordinary differential equation with constant coefficient using Laplace transform, solution of simultaneous Ordinary differential equations. | |||||||||||||||||||||||||||||
Text Books And Reference Books: B. Davis, Integral transforms and their Applications, 2nd ed., Springer Science and Business Media, 2013. | |||||||||||||||||||||||||||||
Essential Reading / Recommended Reading
| |||||||||||||||||||||||||||||
Evaluation Pattern
| |||||||||||||||||||||||||||||
MAT541B - MATHEMATICAL MODELLING (2022 Batch) | |||||||||||||||||||||||||||||
Total Teaching Hours for Semester:45 |
No of Lecture Hours/Week:3 |
||||||||||||||||||||||||||||
Max Marks:100 |
Credits:3 |
||||||||||||||||||||||||||||
Course Objectives/Course Description |
|||||||||||||||||||||||||||||
Course Description: This course is concerned with the fundamentals of mathematical modeling. It deals with finding solution to real world problems by transforming into mathematical models using differential equations. The coverage includes mathematical modeling through first order, second order and system of ordinary differential equations. Course objectives: This course will help the learner to This course will help the learner to COBJ1. interpret the real-world problems in the form of first and second order differential equations. COBJ2. familiarize with some classical linear and nonlinear models. COBJ3. analyse the solutions of systems of differential equations by phase portrait method. |
|||||||||||||||||||||||||||||
Learning Outcome |
|||||||||||||||||||||||||||||
CO1.: On successful completion of the course, the students should be able to apply differential equations in other branches of sciences, commerce, medicine and others CO2.: On successful completion of the course, the students should be able to understand the formulation of some classical mathematical models. CO3.: On successful completion of the course, the students should be able to demonstrate competence with a wide variety of mathematical tools and techniques. CO4.: On successful completion of the course, the students should be able to build mathematical models of real-world problems. |
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Mathematical Modeling through First Ordinary Differential Equations
|
|||||||||||||||||||||||||||||
Population Dynamics, Carbon dating, Newtons law of cooling, Epidemics, Economics, Medicine, mixture problem, electric circuit problem, Chemical reactions, Terminal velocity, Continuously compounding of interest. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Mathematical Modeling through First Ordinary Differential Equations
|
|||||||||||||||||||||||||||||
Population Dynamics, Carbon dating, Newtons law of cooling, Epidemics, Economics, Medicine, mixture problem, electric circuit problem, Chemical reactions, Terminal velocity, Continuously compounding of interest. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Mathematical Modeling through First Ordinary Differential Equations
|
|||||||||||||||||||||||||||||
Population Dynamics, Carbon dating, Newtons law of cooling, Epidemics, Economics, Medicine, mixture problem, electric circuit problem, Chemical reactions, Terminal velocity, Continuously compounding of interest. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Mathematical Modeling through First Ordinary Differential Equations
|
|||||||||||||||||||||||||||||
Population Dynamics, Carbon dating, Newtons law of cooling, Epidemics, Economics, Medicine, mixture problem, electric circuit problem, Chemical reactions, Terminal velocity, Continuously compounding of interest. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Mathematical Modeling through First Ordinary Differential Equations
|
|||||||||||||||||||||||||||||
Population Dynamics, Carbon dating, Newtons law of cooling, Epidemics, Economics, Medicine, mixture problem, electric circuit problem, Chemical reactions, Terminal velocity, Continuously compounding of interest. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Mathematical Modeling through First Ordinary Differential Equations
|
|||||||||||||||||||||||||||||
Population Dynamics, Carbon dating, Newtons law of cooling, Epidemics, Economics, Medicine, mixture problem, electric circuit problem, Chemical reactions, Terminal velocity, Continuously compounding of interest. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Mathematical Modeling through First Ordinary Differential Equations
|
|||||||||||||||||||||||||||||
Population Dynamics, Carbon dating, Newtons law of cooling, Epidemics, Economics, Medicine, mixture problem, electric circuit problem, Chemical reactions, Terminal velocity, Continuously compounding of interest. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Mathematical Modeling through Second Ordinary Differential Equations
|
|||||||||||||||||||||||||||||
The vibrations of a mass on a spring, free damped motion, forced motion, resonance phenomena, electric circuit problem, Nonlinear-Pendulum. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Mathematical Modeling through Second Ordinary Differential Equations
|
|||||||||||||||||||||||||||||
The vibrations of a mass on a spring, free damped motion, forced motion, resonance phenomena, electric circuit problem, Nonlinear-Pendulum. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Mathematical Modeling through Second Ordinary Differential Equations
|
|||||||||||||||||||||||||||||
The vibrations of a mass on a spring, free damped motion, forced motion, resonance phenomena, electric circuit problem, Nonlinear-Pendulum. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Mathematical Modeling through Second Ordinary Differential Equations
|
|||||||||||||||||||||||||||||
The vibrations of a mass on a spring, free damped motion, forced motion, resonance phenomena, electric circuit problem, Nonlinear-Pendulum. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Mathematical Modeling through Second Ordinary Differential Equations
|
|||||||||||||||||||||||||||||
The vibrations of a mass on a spring, free damped motion, forced motion, resonance phenomena, electric circuit problem, Nonlinear-Pendulum. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Mathematical Modeling through Second Ordinary Differential Equations
|
|||||||||||||||||||||||||||||
The vibrations of a mass on a spring, free damped motion, forced motion, resonance phenomena, electric circuit problem, Nonlinear-Pendulum. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Mathematical Modeling through Second Ordinary Differential Equations
|
|||||||||||||||||||||||||||||
The vibrations of a mass on a spring, free damped motion, forced motion, resonance phenomena, electric circuit problem, Nonlinear-Pendulum. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Mathematical Modeling through system of linear differential equations:
|
|||||||||||||||||||||||||||||
Phase plane analysis: Phase Portrait for Linear and Non-Linear Systems, Stability Analysis of Solution, Applications, Predator prey model: Lotka-Volterra Model, Kermack-McKendrick Model, Predator-Prey Model and Harvesting Analysis, Competitive-Hunter Model, Combat models: Lanchester Model, Battle of IWO Jima, Battle of Vietnam, Battle of Trafalgar., Mixture Models, Epidemics-SIR model, Economics. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Mathematical Modeling through system of linear differential equations:
|
|||||||||||||||||||||||||||||
Phase plane analysis: Phase Portrait for Linear and Non-Linear Systems, Stability Analysis of Solution, Applications, Predator prey model: Lotka-Volterra Model, Kermack-McKendrick Model, Predator-Prey Model and Harvesting Analysis, Competitive-Hunter Model, Combat models: Lanchester Model, Battle of IWO Jima, Battle of Vietnam, Battle of Trafalgar., Mixture Models, Epidemics-SIR model, Economics. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Mathematical Modeling through system of linear differential equations:
|
|||||||||||||||||||||||||||||
Phase plane analysis: Phase Portrait for Linear and Non-Linear Systems, Stability Analysis of Solution, Applications, Predator prey model: Lotka-Volterra Model, Kermack-McKendrick Model, Predator-Prey Model and Harvesting Analysis, Competitive-Hunter Model, Combat models: Lanchester Model, Battle of IWO Jima, Battle of Vietnam, Battle of Trafalgar., Mixture Models, Epidemics-SIR model, Economics. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Mathematical Modeling through system of linear differential equations:
|
|||||||||||||||||||||||||||||
Phase plane analysis: Phase Portrait for Linear and Non-Linear Systems, Stability Analysis of Solution, Applications, Predator prey model: Lotka-Volterra Model, Kermack-McKendrick Model, Predator-Prey Model and Harvesting Analysis, Competitive-Hunter Model, Combat models: Lanchester Model, Battle of IWO Jima, Battle of Vietnam, Battle of Trafalgar., Mixture Models, Epidemics-SIR model, Economics. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Mathematical Modeling through system of linear differential equations:
|
|||||||||||||||||||||||||||||
Phase plane analysis: Phase Portrait for Linear and Non-Linear Systems, Stability Analysis of Solution, Applications, Predator prey model: Lotka-Volterra Model, Kermack-McKendrick Model, Predator-Prey Model and Harvesting Analysis, Competitive-Hunter Model, Combat models: Lanchester Model, Battle of IWO Jima, Battle of Vietnam, Battle of Trafalgar., Mixture Models, Epidemics-SIR model, Economics. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Mathematical Modeling through system of linear differential equations:
|
|||||||||||||||||||||||||||||
Phase plane analysis: Phase Portrait for Linear and Non-Linear Systems, Stability Analysis of Solution, Applications, Predator prey model: Lotka-Volterra Model, Kermack-McKendrick Model, Predator-Prey Model and Harvesting Analysis, Competitive-Hunter Model, Combat models: Lanchester Model, Battle of IWO Jima, Battle of Vietnam, Battle of Trafalgar., Mixture Models, Epidemics-SIR model, Economics. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Mathematical Modeling through system of linear differential equations:
|
|||||||||||||||||||||||||||||
Phase plane analysis: Phase Portrait for Linear and Non-Linear Systems, Stability Analysis of Solution, Applications, Predator prey model: Lotka-Volterra Model, Kermack-McKendrick Model, Predator-Prey Model and Harvesting Analysis, Competitive-Hunter Model, Combat models: Lanchester Model, Battle of IWO Jima, Battle of Vietnam, Battle of Trafalgar., Mixture Models, Epidemics-SIR model, Economics. | |||||||||||||||||||||||||||||
Text Books And Reference Books:
| |||||||||||||||||||||||||||||
Essential Reading / Recommended Reading
| |||||||||||||||||||||||||||||
Evaluation Pattern
| |||||||||||||||||||||||||||||
MAT541C - GRAPH THEORY (2022 Batch) | |||||||||||||||||||||||||||||
Total Teaching Hours for Semester:45 |
No of Lecture Hours/Week:3 |
||||||||||||||||||||||||||||
Max Marks:100 |
Credits:3 |
||||||||||||||||||||||||||||
Course Objectives/Course Description |
|||||||||||||||||||||||||||||
Course Description: This course is an introductory course to the basic concepts of Graph Theory. This includes a definition of graphs, types of graphs, paths, circuits, trees, shortest paths, and algorithms to find shortest paths. Course objectives: This course will help the learner to COBJ 1. gain conceptual knowledge on terminologies used in graph theory.
COBJ 2. understand the results on graphs and their properties. COBJ 3. gain proof writing and algorithm writing skills. |
|||||||||||||||||||||||||||||
Learning Outcome |
|||||||||||||||||||||||||||||
CO1: On successful completion of the course, the students should be able to understand the terminology related to graphs CO2: On successful completion of the course, the students should be able to analyze the characteristics of graphs by using standard results on graphs CO3: On successful completion of the course, the students should be able to apply proof techniques and write algorithms |
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Introduction to Graphs
|
|||||||||||||||||||||||||||||
Graphs, connected graphs, classes of graphs, regular graphs, degree sequences, matrices, isomorphic graphs. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Introduction to Graphs
|
|||||||||||||||||||||||||||||
Graphs, connected graphs, classes of graphs, regular graphs, degree sequences, matrices, isomorphic graphs. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Introduction to Graphs
|
|||||||||||||||||||||||||||||
Graphs, connected graphs, classes of graphs, regular graphs, degree sequences, matrices, isomorphic graphs. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Introduction to Graphs
|
|||||||||||||||||||||||||||||
Graphs, connected graphs, classes of graphs, regular graphs, degree sequences, matrices, isomorphic graphs. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Introduction to Graphs
|
|||||||||||||||||||||||||||||
Graphs, connected graphs, classes of graphs, regular graphs, degree sequences, matrices, isomorphic graphs. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Introduction to Graphs
|
|||||||||||||||||||||||||||||
Graphs, connected graphs, classes of graphs, regular graphs, degree sequences, matrices, isomorphic graphs. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Introduction to Graphs
|
|||||||||||||||||||||||||||||
Graphs, connected graphs, classes of graphs, regular graphs, degree sequences, matrices, isomorphic graphs. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Connectivity
|
|||||||||||||||||||||||||||||
Bridges, trees, minimum spanning trees, cut-vertices, blocks, traversability, Eulerian and Hamiltonian graphs, digraphs. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Connectivity
|
|||||||||||||||||||||||||||||
Bridges, trees, minimum spanning trees, cut-vertices, blocks, traversability, Eulerian and Hamiltonian graphs, digraphs. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Connectivity
|
|||||||||||||||||||||||||||||
Bridges, trees, minimum spanning trees, cut-vertices, blocks, traversability, Eulerian and Hamiltonian graphs, digraphs. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Connectivity
|
|||||||||||||||||||||||||||||
Bridges, trees, minimum spanning trees, cut-vertices, blocks, traversability, Eulerian and Hamiltonian graphs, digraphs. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Connectivity
|
|||||||||||||||||||||||||||||
Bridges, trees, minimum spanning trees, cut-vertices, blocks, traversability, Eulerian and Hamiltonian graphs, digraphs. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Connectivity
|
|||||||||||||||||||||||||||||
Bridges, trees, minimum spanning trees, cut-vertices, blocks, traversability, Eulerian and Hamiltonian graphs, digraphs. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Connectivity
|
|||||||||||||||||||||||||||||
Bridges, trees, minimum spanning trees, cut-vertices, blocks, traversability, Eulerian and Hamiltonian graphs, digraphs. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Planarity
|
|||||||||||||||||||||||||||||
Matching, factorizations, decompositions, graceful labeling, planar graphs, Embedding graphs on surfaces. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Planarity
|
|||||||||||||||||||||||||||||
Matching, factorizations, decompositions, graceful labeling, planar graphs, Embedding graphs on surfaces. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Planarity
|
|||||||||||||||||||||||||||||
Matching, factorizations, decompositions, graceful labeling, planar graphs, Embedding graphs on surfaces. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Planarity
|
|||||||||||||||||||||||||||||
Matching, factorizations, decompositions, graceful labeling, planar graphs, Embedding graphs on surfaces. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Planarity
|
|||||||||||||||||||||||||||||
Matching, factorizations, decompositions, graceful labeling, planar graphs, Embedding graphs on surfaces. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Planarity
|
|||||||||||||||||||||||||||||
Matching, factorizations, decompositions, graceful labeling, planar graphs, Embedding graphs on surfaces. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Planarity
|
|||||||||||||||||||||||||||||
Matching, factorizations, decompositions, graceful labeling, planar graphs, Embedding graphs on surfaces. | |||||||||||||||||||||||||||||
Text Books And Reference Books:
| |||||||||||||||||||||||||||||
Essential Reading / Recommended Reading
| |||||||||||||||||||||||||||||
Evaluation Pattern
| |||||||||||||||||||||||||||||
MAT541D - CALCULUS OF SEVERAL VARIABLES (2022 Batch) | |||||||||||||||||||||||||||||
Total Teaching Hours for Semester:45 |
No of Lecture Hours/Week:3 |
||||||||||||||||||||||||||||
Max Marks:100 |
Credits:3 |
||||||||||||||||||||||||||||
Course Objectives/Course Description |
|||||||||||||||||||||||||||||
Course Description: This course aims to enlighten students with the fundamental concepts of vectors, geometry of space, partial differentiation and vector analysis such as gradient, divergence, curl, and the evaluation of line, surface and volume integrals. The three classical theorems, viz., Green’s theorem, Gauss divergence theorem and Stoke’s theorem are also covered. Course objectives: This course will help the learner to COBJ 1. gain familiarity with the fundamental concepts of vectors and geometry of space Curves. COBJ 2. illustrates and interprets differential and integral calculus of vector fields COBJ 3. demonstrate the use Green’s Theorem, Stokes Theorem, and Gauss’ divergence Theorem |
|||||||||||||||||||||||||||||
Learning Outcome |
|||||||||||||||||||||||||||||
CO1: On successful completion of the course, the students should be able to solve problems involving vector operations. CO2: On successful completion of the course, the students should be able to understand the TNB framework and derive Serret-Frenet formula. CO3: On successful completion of the course, the students should be able to compute double integrals and be familiar with change of order of integration. CO4: On successful completion of the course, the students should be able to understand the concept of line integrals for vector valued functions. CO5: On successful completion of the course, the students should be able to apply Green's Theorem, Divergence Theorem and Stoke's Theorem. |
Unit-1 |
Teaching Hours:15 |
Vectors and Geometry of Space
|
|
Fundamentals: Three-dimensional coordination systems, Vectors and vector operations, Line and planes in space, Curves in space and their tangents, Integrals of vector functions, Arc length in space, Curvature and normal vectors of a space, TNB frame, Directional derivatives and gradient vectors, Divergence and curl of vector valued functions. | |
Unit-1 |
Teaching Hours:15 |
Vectors and Geometry of Space
|
|
Fundamentals: Three-dimensional coordination systems, Vectors and vector operations, Line and planes in space, Curves in space and their tangents, Integrals of vector functions, Arc length in space, Curvature and normal vectors of a space, TNB frame, Directional derivatives and gradient vectors, Divergence and curl of vector valued functions. | |
Unit-1 |
Teaching Hours:15 |
Vectors and Geometry of Space
|
|
Fundamentals: Three-dimensional coordination systems, Vectors and vector operations, Line and planes in space, Curves in space and their tangents, Integrals of vector functions, Arc length in space, Curvature and normal vectors of a space, TNB frame, Directional derivatives and gradient vectors, Divergence and curl of vector valued functions. | |
Unit-1 |
Teaching Hours:15 |
Vectors and Geometry of Space
|
|
Fundamentals: Three-dimensional coordination systems, Vectors and vector operations, Line and planes in space, Curves in space and their tangents, Integrals of vector functions, Arc length in space, Curvature and normal vectors of a space, TNB frame, Directional derivatives and gradient vectors, Divergence and curl of vector valued functions. | |
Unit-1 |
Teaching Hours:15 |
Vectors and Geometry of Space
|
|
Fundamentals: Three-dimensional coordination systems, Vectors and vector operations, Line and planes in space, Curves in space and their tangents, Integrals of vector functions, Arc length in space, Curvature and normal vectors of a space, TNB frame, Directional derivatives and gradient vectors, Divergence and curl of vector valued functions. | |
Unit-2 |
Teaching Hours:15 |
Multiple Integrals
|
|
Double Integrals- Areas, Moments, and Centres of Mass – Double Integrals in Polar Form –Triple Integrals in Rectangular Coordinates, Masses and Moments in Three Dimensions, Triple Integrals in Cylindrical and Spherical Coordinates, Substitutions in Multiple Integrals. | |
Unit-2 |
Teaching Hours:15 |
Multiple Integrals
|
|
Double Integrals- Areas, Moments, and Centres of Mass – Double Integrals in Polar Form –Triple Integrals in Rectangular Coordinates, Masses and Moments in Three Dimensions, Triple Integrals in Cylindrical and Spherical Coordinates, Substitutions in Multiple Integrals. | |
Unit-2 |
Teaching Hours:15 |
Multiple Integrals
|
|
Double Integrals- Areas, Moments, and Centres of Mass – Double Integrals in Polar Form –Triple Integrals in Rectangular Coordinates, Masses and Moments in Three Dimensions, Triple Integrals in Cylindrical and Spherical Coordinates, Substitutions in Multiple Integrals. | |
Unit-2 |
Teaching Hours:15 |
Multiple Integrals
|
|
Double Integrals- Areas, Moments, and Centres of Mass – Double Integrals in Polar Form –Triple Integrals in Rectangular Coordinates, Masses and Moments in Three Dimensions, Triple Integrals in Cylindrical and Spherical Coordinates, Substitutions in Multiple Integrals. | |
Unit-2 |
Teaching Hours:15 |
Multiple Integrals
|
|
Double Integrals- Areas, Moments, and Centres of Mass – Double Integrals in Polar Form –Triple Integrals in Rectangular Coordinates, Masses and Moments in Three Dimensions, Triple Integrals in Cylindrical and Spherical Coordinates, Substitutions in Multiple Integrals. | |
Unit-3 |
Teaching Hours:15 |
Integration in Vector Fields
|
|
Line Integrals, Vector Fields, Work, Circulation and Flux, Path Independence, Potential Functions, and Conservative Fields, Green’s Theorem in the Plane, Surface Area and Surface Integrals, Parametrized Surfaces, Stokes’ Theorem, The Divergence Theorem. | |
Unit-3 |
Teaching Hours:15 |
Integration in Vector Fields
|
|
Line Integrals, Vector Fields, Work, Circulation and Flux, Path Independence, Potential Functions, and Conservative Fields, Green’s Theorem in the Plane, Surface Area and Surface Integrals, Parametrized Surfaces, Stokes’ Theorem, The Divergence Theorem. | |
Unit-3 |
Teaching Hours:15 |
Integration in Vector Fields
|
|
Line Integrals, Vector Fields, Work, Circulation and Flux, Path Independence, Potential Functions, and Conservative Fields, Green’s Theorem in the Plane, Surface Area and Surface Integrals, Parametrized Surfaces, Stokes’ Theorem, The Divergence Theorem. | |
Unit-3 |
Teaching Hours:15 |
Integration in Vector Fields
|
|
Line Integrals, Vector Fields, Work, Circulation and Flux, Path Independence, Potential Functions, and Conservative Fields, Green’s Theorem in the Plane, Surface Area and Surface Integrals, Parametrized Surfaces, Stokes’ Theorem, The Divergence Theorem. | |
Unit-3 |
Teaching Hours:15 |
Integration in Vector Fields
|
|
Line Integrals, Vector Fields, Work, Circulation and Flux, Path Independence, Potential Functions, and Conservative Fields, Green’s Theorem in the Plane, Surface Area and Surface Integrals, Parametrized Surfaces, Stokes’ Theorem, The Divergence Theorem. | |
Text Books And Reference Books: J. R. Hass, C Heil, M D Weir, Thomas’ Calculus, 14th ed., USA: Pearson, 2018. | |
Essential Reading / Recommended Reading
| |
Evaluation Pattern
| |
MAT541E - OPERATIONS RESEARCH (2022 Batch) | |
Total Teaching Hours for Semester:45 |
No of Lecture Hours/Week:3 |
Max Marks:100 |
Credits:3 |
Course Objectives/Course Description |
|
Course description: Operations research deals with the problems on optimization or decision making that are affected by certain constraints / restrictions in the environment. This course aims at teaching solution techniques of solving linear programming models, simple queuing model, two-person zero sum games and Network models. Course objectives: This course will help the learner to COBJ1. gain an insight executing the algorithms for solving linear programming problems including transportation and assignment problems. COBJ2. learn about the techniques involved in solving the two person zero sum game. COBJ3. calculate the estimates that characteristics the queues and perform desired analysis on a network. |
|
Learning Outcome |
|
CO1: On successful completion of the course, the students should be able to solve Linear Programming Problems using Simplex Algorithm, Transportation and Assignment Problems.
CO2: On successful completion of the course, the students should be able to find the estimates that characterizes different types of Queuing Models.
CO3: On successful completion of the course, the students should be able to obtain the solution for two person zero sum games using Linear Programming. CO4: On successful completion of the course, the students should be able to formulate Maximal Flow Model using Linear Programming and perform computations using PERT and CPM. |
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Introduction to Linear Programming Problems
|
|||||||||||||||||||||||||||||
Introduction to simplex algorithm –Special cases in the Simplex Method –Definition of the Dual Problem – Primal Dual relationships – Dual simplex methods. Transportation Models: Determination of the starting solution – iterative computations of the transportation algorithm. Assignment Model: The Hungarian Method. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Introduction to Linear Programming Problems
|
|||||||||||||||||||||||||||||
Introduction to simplex algorithm –Special cases in the Simplex Method –Definition of the Dual Problem – Primal Dual relationships – Dual simplex methods. Transportation Models: Determination of the starting solution – iterative computations of the transportation algorithm. Assignment Model: The Hungarian Method. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Introduction to Linear Programming Problems
|
|||||||||||||||||||||||||||||
Introduction to simplex algorithm –Special cases in the Simplex Method –Definition of the Dual Problem – Primal Dual relationships – Dual simplex methods. Transportation Models: Determination of the starting solution – iterative computations of the transportation algorithm. Assignment Model: The Hungarian Method. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Introduction to Linear Programming Problems
|
|||||||||||||||||||||||||||||
Introduction to simplex algorithm –Special cases in the Simplex Method –Definition of the Dual Problem – Primal Dual relationships – Dual simplex methods. Transportation Models: Determination of the starting solution – iterative computations of the transportation algorithm. Assignment Model: The Hungarian Method. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Introduction to Linear Programming Problems
|
|||||||||||||||||||||||||||||
Introduction to simplex algorithm –Special cases in the Simplex Method –Definition of the Dual Problem – Primal Dual relationships – Dual simplex methods. Transportation Models: Determination of the starting solution – iterative computations of the transportation algorithm. Assignment Model: The Hungarian Method. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Introduction to Linear Programming Problems
|
|||||||||||||||||||||||||||||
Introduction to simplex algorithm –Special cases in the Simplex Method –Definition of the Dual Problem – Primal Dual relationships – Dual simplex methods. Transportation Models: Determination of the starting solution – iterative computations of the transportation algorithm. Assignment Model: The Hungarian Method. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Introduction to Linear Programming Problems
|
|||||||||||||||||||||||||||||
Introduction to simplex algorithm –Special cases in the Simplex Method –Definition of the Dual Problem – Primal Dual relationships – Dual simplex methods. Transportation Models: Determination of the starting solution – iterative computations of the transportation algorithm. Assignment Model: The Hungarian Method. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Queuing Theory and Game Theory
|
|||||||||||||||||||||||||||||
Elements of a queuing Model – Pure Birth Model – Pure Death Model –Specialized Poisson Queues – Steady state Models: (M/M/1):(GD/∞/∞) – (M/M/1):(FCFS/∞/∞) - (M/M/1):(GD/N/∞) – (M/M/c):(GD/∞/∞) – (M/M/∞):(GD/∞/∞). Game Theory: Optimal solution of two person zero-sum games – Solution of Mixed strategy Games (only Linear programming solution).
| |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Queuing Theory and Game Theory
|
|||||||||||||||||||||||||||||
Elements of a queuing Model – Pure Birth Model – Pure Death Model –Specialized Poisson Queues – Steady state Models: (M/M/1):(GD/∞/∞) – (M/M/1):(FCFS/∞/∞) - (M/M/1):(GD/N/∞) – (M/M/c):(GD/∞/∞) – (M/M/∞):(GD/∞/∞). Game Theory: Optimal solution of two person zero-sum games – Solution of Mixed strategy Games (only Linear programming solution).
| |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Queuing Theory and Game Theory
|
|||||||||||||||||||||||||||||
Elements of a queuing Model – Pure Birth Model – Pure Death Model –Specialized Poisson Queues – Steady state Models: (M/M/1):(GD/∞/∞) – (M/M/1):(FCFS/∞/∞) - (M/M/1):(GD/N/∞) – (M/M/c):(GD/∞/∞) – (M/M/∞):(GD/∞/∞). Game Theory: Optimal solution of two person zero-sum games – Solution of Mixed strategy Games (only Linear programming solution).
| |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Queuing Theory and Game Theory
|
|||||||||||||||||||||||||||||
Elements of a queuing Model – Pure Birth Model – Pure Death Model –Specialized Poisson Queues – Steady state Models: (M/M/1):(GD/∞/∞) – (M/M/1):(FCFS/∞/∞) - (M/M/1):(GD/N/∞) – (M/M/c):(GD/∞/∞) – (M/M/∞):(GD/∞/∞). Game Theory: Optimal solution of two person zero-sum games – Solution of Mixed strategy Games (only Linear programming solution).
| |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Queuing Theory and Game Theory
|
|||||||||||||||||||||||||||||
Elements of a queuing Model – Pure Birth Model – Pure Death Model –Specialized Poisson Queues – Steady state Models: (M/M/1):(GD/∞/∞) – (M/M/1):(FCFS/∞/∞) - (M/M/1):(GD/N/∞) – (M/M/c):(GD/∞/∞) – (M/M/∞):(GD/∞/∞). Game Theory: Optimal solution of two person zero-sum games – Solution of Mixed strategy Games (only Linear programming solution).
| |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Queuing Theory and Game Theory
|
|||||||||||||||||||||||||||||
Elements of a queuing Model – Pure Birth Model – Pure Death Model –Specialized Poisson Queues – Steady state Models: (M/M/1):(GD/∞/∞) – (M/M/1):(FCFS/∞/∞) - (M/M/1):(GD/N/∞) – (M/M/c):(GD/∞/∞) – (M/M/∞):(GD/∞/∞). Game Theory: Optimal solution of two person zero-sum games – Solution of Mixed strategy Games (only Linear programming solution).
| |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Queuing Theory and Game Theory
|
|||||||||||||||||||||||||||||
Elements of a queuing Model – Pure Birth Model – Pure Death Model –Specialized Poisson Queues – Steady state Models: (M/M/1):(GD/∞/∞) – (M/M/1):(FCFS/∞/∞) - (M/M/1):(GD/N/∞) – (M/M/c):(GD/∞/∞) – (M/M/∞):(GD/∞/∞). Game Theory: Optimal solution of two person zero-sum games – Solution of Mixed strategy Games (only Linear programming solution).
| |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Network Models
|
|||||||||||||||||||||||||||||
Linear programming formulation of the shortest-route Problem. Maximal Flow model:- Enumeration of cuts – Maximal Flow Algorithm – Linear Programming Formulation of Maximal Flow Model. CPM and PERT:- Network Representation – Critical path computations – Construction of the Time Schedule – Linear Programming formulation of CPM – PERT calculations. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Network Models
|
|||||||||||||||||||||||||||||
Linear programming formulation of the shortest-route Problem. Maximal Flow model:- Enumeration of cuts – Maximal Flow Algorithm – Linear Programming Formulation of Maximal Flow Model. CPM and PERT:- Network Representation – Critical path computations – Construction of the Time Schedule – Linear Programming formulation of CPM – PERT calculations. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Network Models
|
|||||||||||||||||||||||||||||
Linear programming formulation of the shortest-route Problem. Maximal Flow model:- Enumeration of cuts – Maximal Flow Algorithm – Linear Programming Formulation of Maximal Flow Model. CPM and PERT:- Network Representation – Critical path computations – Construction of the Time Schedule – Linear Programming formulation of CPM – PERT calculations. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Network Models
|
|||||||||||||||||||||||||||||
Linear programming formulation of the shortest-route Problem. Maximal Flow model:- Enumeration of cuts – Maximal Flow Algorithm – Linear Programming Formulation of Maximal Flow Model. CPM and PERT:- Network Representation – Critical path computations – Construction of the Time Schedule – Linear Programming formulation of CPM – PERT calculations. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Network Models
|
|||||||||||||||||||||||||||||
Linear programming formulation of the shortest-route Problem. Maximal Flow model:- Enumeration of cuts – Maximal Flow Algorithm – Linear Programming Formulation of Maximal Flow Model. CPM and PERT:- Network Representation – Critical path computations – Construction of the Time Schedule – Linear Programming formulation of CPM – PERT calculations. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Network Models
|
|||||||||||||||||||||||||||||
Linear programming formulation of the shortest-route Problem. Maximal Flow model:- Enumeration of cuts – Maximal Flow Algorithm – Linear Programming Formulation of Maximal Flow Model. CPM and PERT:- Network Representation – Critical path computations – Construction of the Time Schedule – Linear Programming formulation of CPM – PERT calculations. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Network Models
|
|||||||||||||||||||||||||||||
Linear programming formulation of the shortest-route Problem. Maximal Flow model:- Enumeration of cuts – Maximal Flow Algorithm – Linear Programming Formulation of Maximal Flow Model. CPM and PERT:- Network Representation – Critical path computations – Construction of the Time Schedule – Linear Programming formulation of CPM – PERT calculations. | |||||||||||||||||||||||||||||
Text Books And Reference Books: A.H. Taha, Operations research, 9th ed., Pearson Education, 2014. | |||||||||||||||||||||||||||||
Essential Reading / Recommended Reading
| |||||||||||||||||||||||||||||
Evaluation Pattern
| |||||||||||||||||||||||||||||
MAT551 - LINEAR ALGEBRA USING PYTHON (2022 Batch) | |||||||||||||||||||||||||||||
Total Teaching Hours for Semester:30 |
No of Lecture Hours/Week:2 |
||||||||||||||||||||||||||||
Max Marks:50 |
Credits:2 |
||||||||||||||||||||||||||||
Course Objectives/Course Description |
|||||||||||||||||||||||||||||
Course description: This course aims at providing hands on experience in using Python functions to illustrate the notions vector space, linear independence, linear dependence, linear transformation and rank. Course objectives: This course will help the learner to COBJ1. The built in functions required to deal with vectors and Linear Transformations. COBJ2. Python skills to handle vectors using the properties of vector spaces and linear transformations |
|||||||||||||||||||||||||||||
Learning Outcome |
|||||||||||||||||||||||||||||
CO1: On successful completion of the course, the students should be able to use Python functions in applying the notions of matrices and system of equations.
CO2: On successful completion of the course, the students should be able to use Python functions in applying the problems on vector space.
CO3: On successful completion of the course, the students should be able to apply python functions to solve the problems on linear transformations.
|
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics:
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics:
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics:
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics:
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics:
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics:
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics:
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Text Books And Reference Books:
| |||||||||||||||||||||||||||||
Essential Reading / Recommended Reading
| |||||||||||||||||||||||||||||
Evaluation Pattern The course is evaluated based on continuous internal assessments (CIA) and the lab e-record. The parameters for evaluation under each component and the mode of assessment are given below.
| |||||||||||||||||||||||||||||
MAT551A - INTEGRAL TRANSFORMS USING PYTHON (2022 Batch) | |||||||||||||||||||||||||||||
Total Teaching Hours for Semester:30 |
No of Lecture Hours/Week:2 |
||||||||||||||||||||||||||||
Max Marks:50 |
Credits:2 |
||||||||||||||||||||||||||||
Course Objectives/Course Description |
|||||||||||||||||||||||||||||
This course will help students to gain skills in using Python to illustrate Fourier transforms, Laplace transforms for some standard functions and implementing Laplace transforms in solving ordinary differential equations of first and second order with constant coefficient. Course Objectives: This course will help the learner to COBJ1. code python language using jupyter interface. COBJ2. use built in functions required to deal with Fourier and Laplace transforms. COBJ3. calculate Inverse Laplace transforms and the inverse Fourier transforms of standard functions using sympy.integrals |
|||||||||||||||||||||||||||||
Learning Outcome |
|||||||||||||||||||||||||||||
CO1.: On successful completion of the course, the students should be able to acquire skill in Python Programming to illustrate Fourier series, Fourier and Laplace transforms. CO2.: On successful completion of the course, the students should be able to use Python program to solve ODE's by Laplace transforms. |
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Integral transforms using Python
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Integral transforms using Python
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Integral transforms using Python
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Integral transforms using Python
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Integral transforms using Python
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Text Books And Reference Books: J. Nunez-Iglesias, S. van der Walt, and H. Dashnow, Elegant SciPy: The art of scientific Python. O'Reilly Media, 2017. | |||||||||||||||||||||||||||||
Essential Reading / Recommended Reading
| |||||||||||||||||||||||||||||
Evaluation Pattern
| |||||||||||||||||||||||||||||
MAT551B - MATHEMATICAL MODELLING USING PYTHON (2022 Batch) | |||||||||||||||||||||||||||||
Total Teaching Hours for Semester:30 |
No of Lecture Hours/Week:2 |
||||||||||||||||||||||||||||
Max Marks:50 |
Credits:2 |
||||||||||||||||||||||||||||
Course Objectives/Course Description |
|||||||||||||||||||||||||||||
Course description: This course provides students with an understanding of the practical and theoretical aspects of mathematical models involving ordinary differential equations (ODEs) using Python programming. Course objectives: This course will help the learner to COBJ1. various models spanning disciplines such as physics, biology, engineering, and finance. COBJ2. develop the basic understanding of differential equations and skills to implement numerical algorithms to solve mathematical problems using Python. |
|||||||||||||||||||||||||||||
Learning Outcome |
|||||||||||||||||||||||||||||
CO1.: On successful completion of the course, the students should be able to acquire proficiency in using Python. CO2.: On successful completion of the course, the students should be able to demonstrate the use of Python to understand and interpret applications of differential equations CO3.: On successful completion of the course, the students should be able to apply the theoretical and practical knowledge to real life situations. |
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Propopsed Topics
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Propopsed Topics
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Propopsed Topics
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Propopsed Topics
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Propopsed Topics
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Propopsed Topics
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Propopsed Topics
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Text Books And Reference Books: H P Langtangen, A Primer on Scientific Programming with Python, 2nd ed., Springer, 2016. | |||||||||||||||||||||||||||||
Essential Reading / Recommended Reading
| |||||||||||||||||||||||||||||
Evaluation Pattern The course is evaluated based on continuous internal assessments (CIA) and the lab e-record. The parameters for evaluation under each component and the mode of assessment are given below.
| |||||||||||||||||||||||||||||
MAT551C - GRAPH THEORY USING PYTHON (2022 Batch) | |||||||||||||||||||||||||||||
Total Teaching Hours for Semester:30 |
No of Lecture Hours/Week:2 |
||||||||||||||||||||||||||||
Max Marks:50 |
Credits:2 |
||||||||||||||||||||||||||||
Course Objectives/Course Description |
|||||||||||||||||||||||||||||
Course description: The course graph theory using Python is aimed at enabling the students to appreciate and understand core concepts of graph theory with the help of technological tools. It is designed with a learner-centric approach wherein the students will understand the concepts of graph theory using programming tools and develop computational skills. Course objectives: This course will help the learner to COBJ1. gain familiarity in Python language using jupyter interface and NetworkX package COBJ2. construct graphs and analyze their structural properties. COBJ3. implement standard algorithms for shortest paths, minimal spanning trees and graph searching.. |
|||||||||||||||||||||||||||||
Learning Outcome |
|||||||||||||||||||||||||||||
CO1: On successful completion of the course, the students should be able to
construct graphs using related matrices CO2: On successful completion of the course, the students should be able to
compute the graph parameters related to degrees and distances CO3: On successful completion of the course, the students should be able to
gain mastery to deal with optimization problems related to networks CO4: On successful completion of the course, the students should be able to
apply algorithmic approach in solving graph theory problems |
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics:
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics:
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics:
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics:
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics:
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics:
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics:
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Text Books And Reference Books: Mohammed Zuhair, Kadry, Seifedine, Al-Taie, Python for Graph and Network Analysis.Springer, 2017. | |||||||||||||||||||||||||||||
Essential Reading / Recommended Reading
| |||||||||||||||||||||||||||||
Evaluation Pattern The course is evaluated based on continuous internal assessments (CIA) and the lab e-record. The parameters for evaluation under each component and the mode of assessment are given below.
| |||||||||||||||||||||||||||||
MAT551D - CALCULUS OF SEVERAL VARIABLES USING PYTHON (2022 Batch) | |||||||||||||||||||||||||||||
Total Teaching Hours for Semester:30 |
No of Lecture Hours/Week:2 |
||||||||||||||||||||||||||||
Max Marks:50 |
Credits:2 |
||||||||||||||||||||||||||||
Course Objectives/Course Description |
|||||||||||||||||||||||||||||
Course description: The course calculus of several variables using python is aimed at enabling the students to explore and study the calculus with several variables in a detailed manner with the help of the mathematical packages available in Python. This course is designed with a learner-centric approach wherein the students will acquire mastery in understanding multivariate calculus using Python modules. Course objectives: This course will help the learner to gain a familiarity with COBJ1. skills to implement Python language in calculus of several variables COBJ2. the built-in functions available in library to deal with problems in multivariate calculus |
|||||||||||||||||||||||||||||
Learning Outcome |
|||||||||||||||||||||||||||||
CO1: The objective is to familiarize students in using Python for demonstrating the plotting of lines in two and three dimensional space CO2: The objective is to familiarize students in using Python for implementing appropriate codes for finding tangent vector and gradient vector CO3: The objective is to familiarize students in using Python for evaluating the line and double integrals using sympy module CO4: The objective is to familiarize students in using Python for acquainting suitable commands for problems in applications of line and double integrals. |
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Text Books And Reference Books: H P Langtangen, A Primer on Scientific Programming with Python, 2nd ed., Springer, 2016 | |||||||||||||||||||||||||||||
Essential Reading / Recommended Reading
| |||||||||||||||||||||||||||||
Evaluation Pattern The course is evaluated based on continuous internal assessments (CIA) and the lab e-record. The parameters for evaluation under each component and the mode of assessment are given below.
| |||||||||||||||||||||||||||||
MAT551E - OPERATIONS RESEARCH USING PYTHON (2022 Batch) | |||||||||||||||||||||||||||||
Total Teaching Hours for Semester:30 |
No of Lecture Hours/Week:2 |
||||||||||||||||||||||||||||
Max Marks:50 |
Credits:2 |
||||||||||||||||||||||||||||
Course Objectives/Course Description |
|||||||||||||||||||||||||||||
Course description: Operations research deals with the problems on optimization or decision making that are affected by certain constraints / restrictions in the environment. This course aims to enhance programming skills in Python to solve problems chosen from Operations Research.
Course objectives: This course will help the learner to COBJ1. gain a familiarity in using Python to solve linear programming problems, calculate the estimates that characteristics the queues and perform desired analysis on a network. COBJ2. use Python for solving problems on Operations Research. |
|||||||||||||||||||||||||||||
Learning Outcome |
|||||||||||||||||||||||||||||
CO1: On successful completion of the course, the students should be able to use Python programming to solve linear programming problems by using simplex method and dual simplex method. CO2: On successful completion of the course, the students should be able to solve Transportation Problems and Assignment Problems using Python module. CO3: On successful completion of the course, the students should be able to demonstrate competence in using Python modules to solve M/M/1, M/M/c queues, and Computations on Networks. |
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Text Books And Reference Books: Garrido José M. Introduction to Computational Models with Python. CRC Press, 2016 | |||||||||||||||||||||||||||||
Essential Reading / Recommended Reading
| |||||||||||||||||||||||||||||
Evaluation Pattern The course is evaluated based on continuous internal assessments (CIA) and the lab e-record. The parameters for evaluation under each component and the mode of assessment are given below.
| |||||||||||||||||||||||||||||
STA531 - LINEAR REGRESSION MODELS (2022 Batch) | |||||||||||||||||||||||||||||
Total Teaching Hours for Semester:45 |
No of Lecture Hours/Week:3 |
||||||||||||||||||||||||||||
Max Marks:100 |
Credits:3 |
||||||||||||||||||||||||||||
Course Objectives/Course Description |
|||||||||||||||||||||||||||||
This course deals with simple and multiple linear regression models with their assumptions, estimation and their significance of regression coefficients. Model and variable selection techniques and variable transformation techniques are discussed. |
|||||||||||||||||||||||||||||
Learning Outcome |
|||||||||||||||||||||||||||||
CO1: Demonstrate simple and multiple regression analysis with one dependent and one or more independent variables. CO2: Infer about r-square, adjusted r-square for model selection. CO3: Apply the concepts of forward, backward and stepwise methods for selecting the independent variables. CO4: Demonstrate the concepts of heteroscedasticity, multicollinearity, autocorrelation and residual plots. |
Unit-1 |
Teaching Hours:15 |
Simple Linear Regression
|
|
Introduction to regression analysis - modelling a response - overview and applications of regression analysis - major steps in regression analysis - simple linear regression (Two variables): assumptions - estimation and properties of regression coefficients - significance of regression coefficients. | |
Unit-1 |
Teaching Hours:15 |
Simple Linear Regression
|
|
Introduction to regression analysis - modelling a response - overview and applications of regression analysis - major steps in regression analysis - simple linear regression (Two variables): assumptions - estimation and properties of regression coefficients - significance of regression coefficients. | |
Unit-2 |
Teaching Hours:10 |
Multiple Linear Regression
|
|
Multiple linear regression model - assumptions - ordinary least square estimation of regression coefficients - interpretation and properties of regression coefficient - significance of regression coefficients. | |
Unit-2 |
Teaching Hours:10 |
Multiple Linear Regression
|
|
Multiple linear regression model - assumptions - ordinary least square estimation of regression coefficients - interpretation and properties of regression coefficient - significance of regression coefficients. | |
Unit-3 |
Teaching Hours:10 |
Criteria for Model Selection and Residual Analysis
|
|
Mean Square error criteria - R2 and criteria for model selection - Forward, Backward and Stepwise procedures - Statistical analysis of residuals - various types of residuals - residual plots, Need of the transformation of variables - Box-Cox transformation. | |
Unit-3 |
Teaching Hours:10 |
Criteria for Model Selection and Residual Analysis
|
|
Mean Square error criteria - R2 and criteria for model selection - Forward, Backward and Stepwise procedures - Statistical analysis of residuals - various types of residuals - residual plots, Need of the transformation of variables - Box-Cox transformation. | |
Unit-4 |
Teaching Hours:10 |
Tests of assumptions in MLR
|
|
Concept of heteroscedasticity - multicollinearity - autocorrelation and their practical consequences - detection and remedial measures. | |
Unit-4 |
Teaching Hours:10 |
Tests of assumptions in MLR
|
|
Concept of heteroscedasticity - multicollinearity - autocorrelation and their practical consequences - detection and remedial measures. | |
Text Books And Reference Books: 1. Montgomery D.C, Peck E.A and Vining G.G, Introduction to Linear Regression Analysis, 5th edition, John Wiley and Sons Inc., New York, 2012. 2. Debasis Sengupta and S. R Jammalamadaka, Linear Models and Regression with R: An Integrated Approach, World Scientific Publishing, Singapore, 2020 | |
Essential Reading / Recommended Reading 1. George A.F.S. and Lee A.J., Linear Regression Analysis, John Wiley and Sons, Inc, 2012.
2. Pardoe I, Applied Regression Modeling, John Wiley and Sons Inc, New York, 2012
3. Wasserman L, All of Statistics - A Concise Course in Statistical Inference, Springer Series in Statistics, 2010. | |
Evaluation Pattern CIA 50% ESE 50% | |
STA541A - SAMPLING TECHNIQUES (2022 Batch) | |
Total Teaching Hours for Semester:45 |
No of Lecture Hours/Week:3 |
Max Marks:100 |
Credits:3 |
Course Objectives/Course Description |
|
This course designed to introduce about official statistical system in India and to understand the concepts of basic Sample survey designs. |
|
Learning Outcome |
|
CO1: Demonstrate the basic principles and different steps in planning a sample survey.
CO2: Analysis various sampling techniques and their application CO3: Demonstrate the official Statistical System in India. |
Unit-1 |
Teaching Hours:10 |
Introduction to Sampling Theory
|
|
Concepts of population and sample. Complete enumeration vs. sampling. Planning of Sampling Survey. Types of sampling: non-probability and probability sampling, basic principle of sample survey, population mean, total and proportion, variances of these estimates and sample size determination, Sampling and non-sampling errors, determination of sample size. | |
Unit-1 |
Teaching Hours:10 |
Introduction to Sampling Theory
|
|
Concepts of population and sample. Complete enumeration vs. sampling. Planning of Sampling Survey. Types of sampling: non-probability and probability sampling, basic principle of sample survey, population mean, total and proportion, variances of these estimates and sample size determination, Sampling and non-sampling errors, determination of sample size. | |
Unit-2 |
Teaching Hours:10 |
Simple Random Sampling
|
|
Simple Random Sampling: Probability of selecting any specified unit in the sample, selection of simple random sample, simple random sample from population with given frequency distribution, SRS of attribute, size of simple random sample for specified precision. Concept of SRSWOR and SRSWR. | |
Unit-2 |
Teaching Hours:10 |
Simple Random Sampling
|
|
Simple Random Sampling: Probability of selecting any specified unit in the sample, selection of simple random sample, simple random sample from population with given frequency distribution, SRS of attribute, size of simple random sample for specified precision. Concept of SRSWOR and SRSWR. | |
Unit-3 |
Teaching Hours:15 |
Stratified Random Sampling and Systematic Sampling
|
|
Stratified random sampling: Technique, estimates of population mean and total, variances of these estimates. Systematic Sampling: Technique, estimates of population mean and total, variances of these estimates (N=nxk).Comparison of systematic sampling with SRS and stratified sampling. | |
Unit-3 |
Teaching Hours:15 |
Stratified Random Sampling and Systematic Sampling
|
|
Stratified random sampling: Technique, estimates of population mean and total, variances of these estimates. Systematic Sampling: Technique, estimates of population mean and total, variances of these estimates (N=nxk).Comparison of systematic sampling with SRS and stratified sampling. | |
Unit-4 |
Teaching Hours:10 |
Official Statistical System
|
|
Present Official Statistical System in India relating to census of population, agriculture, industrial production, and prices; methods of collection of official statistics, their reliability and limitation and the principal publications containing such statistics. Also the various agencies responsible for the data collection- C.S.O., N.S.S.O., Office of Registrar General, their historical development, main functions and important publications. | |
Unit-4 |
Teaching Hours:10 |
Official Statistical System
|
|
Present Official Statistical System in India relating to census of population, agriculture, industrial production, and prices; methods of collection of official statistics, their reliability and limitation and the principal publications containing such statistics. Also the various agencies responsible for the data collection- C.S.O., N.S.S.O., Office of Registrar General, their historical development, main functions and important publications. | |
Text Books And Reference Books:
1. 1. Cochran W.G, Sampling Techniques, 3rd Edition, John Wiley and Sons, New York, 2008. 2. 2. Gupta S.C and Kapoor V.K, Fundamentals of Applied Statistics, 4th Edition, Sultan Chand and Sons, India 2009. | |
Essential Reading / Recommended Reading
1
4. Guide to current Indian Official Statistics, Central Statistical Office, GOI, New Delhi. | |
Evaluation Pattern CIA 50% ESE 50% | |
STA541B - DESIGN OF EXPERIMENTS (2022 Batch) | |
Total Teaching Hours for Semester:45 |
No of Lecture Hours/Week:3 |
Max Marks:100 |
Credits:3 |
Course Objectives/Course Description |
|
This course introduces various experimental designs, selection of appropriate designs in planning a scientific experimentation. |
|
Learning Outcome |
|
CO1: Demonstrate the concepts of Analysis of Variance with comparison of more than two treatment. CO2: Apply the concepts of ANCOVA to compare the efficiency of various designs. CO3: Demonstrate the applications of factorial experiments with confounding. |
Unit-1 |
Teaching Hours:10 |
Analysis of variance
|
|
Meaning and assumptions. Fixed, random and mixed effect models. Analysis of variance of one-way and two-way classified data with and without interaction effects. Multiple comparison tests: Tukey’s method, critical difference. | |
Unit-1 |
Teaching Hours:10 |
Analysis of variance
|
|
Meaning and assumptions. Fixed, random and mixed effect models. Analysis of variance of one-way and two-way classified data with and without interaction effects. Multiple comparison tests: Tukey’s method, critical difference. | |
Unit-2 |
Teaching Hours:10 |
Experimental designs
|
|
Principles of design of experiments. Completely randomized, randomized block, and Latin square designs (CRD, RBD, and LSD) -layout formation and the analysis using fixed effect models. | |
Unit-2 |
Teaching Hours:10 |
Experimental designs
|
|
Principles of design of experiments. Completely randomized, randomized block, and Latin square designs (CRD, RBD, and LSD) -layout formation and the analysis using fixed effect models. | |
Unit-3 |
Teaching Hours:10 |
Efficiency of a design and missing plot technique
|
|
Comparison of efficiencies of CRD, RBD, and LSD. Estimation of single missing observation in RBD and LSD and analysis. | |
Unit-3 |
Teaching Hours:10 |
Efficiency of a design and missing plot technique
|
|
Comparison of efficiencies of CRD, RBD, and LSD. Estimation of single missing observation in RBD and LSD and analysis. | |
Unit-4 |
Teaching Hours:15 |
Factorial experiment
|
|
Factorial experiment: Basic concepts, main effects, interactions, and orthogonal contrasts in 22 and 23 factorial experiments. Yates’ method of computing factorial effects total. Analysis and testing thesignificance of effects in 22 and 23 factorial experiments in RBD. Need for confounding. Complete and partial confounding in a 23 factorial experiment in RBD - layout and its analysis. | |
Unit-4 |
Teaching Hours:15 |
Factorial experiment
|
|
Factorial experiment: Basic concepts, main effects, interactions, and orthogonal contrasts in 22 and 23 factorial experiments. Yates’ method of computing factorial effects total. Analysis and testing thesignificance of effects in 22 and 23 factorial experiments in RBD. Need for confounding. Complete and partial confounding in a 23 factorial experiment in RBD - layout and its analysis. | |
Text Books And Reference Books: 1. Montgomery D.C, Design and Analysis of Experiments, 10th edition, John Wiley and Sons Inc., New York, 2019. 2. Gupta S.C and Kapoor V.K, Fundamentals of Applied Statistics, 4th edition (Reprint), Sultan Chand and Sons, India, 2019. | |
Essential Reading / Recommended Reading 1. Mukhopadhyay P, Mathematical Statistics, 2nd edition revised reprint, Books and Allied (P) Ltd, 2016. 2. Lawson J, Design and Analysis of Experiments with R, 1st edition, CRC Press, 2015. | |
Evaluation Pattern CIA 50% ESE 50% | |
STA541C - ACTUARIAL STATISTICS (2022 Batch) | |
Total Teaching Hours for Semester:45 |
No of Lecture Hours/Week:3 |
Max Marks:100 |
Credits:3 |
Course Objectives/Course Description |
|
This course is designed to introduce the application of statistical methods in framing the insurance policies. |
|
Learning Outcome |
|
CO1: Demonstrate the principle terms used and major life insurance covered by Indian life insurance.
CO2: Infer the calculation of premium for various life insurance policies. |
Unit-1 |
Teaching Hours:10 |
Introductory Statistics and Insurance Applications
|
|
Discrete, continuous and mixed probability distributions. Insurance applications, sum of random variables. Utility theory: Utility functions, expected utility criterion, types of utility function, insurance and utility theory. | |
Unit-1 |
Teaching Hours:10 |
Introductory Statistics and Insurance Applications
|
|
Discrete, continuous and mixed probability distributions. Insurance applications, sum of random variables. Utility theory: Utility functions, expected utility criterion, types of utility function, insurance and utility theory. | |
Unit-2 |
Teaching Hours:10 |
Principles of Premium Calculation
|
|
Properties of premium principles, examples of premium principles. Individual risk models: models for individual claims, the sum of independent claims, approximations and their applications. | |
Unit-2 |
Teaching Hours:10 |
Principles of Premium Calculation
|
|
Properties of premium principles, examples of premium principles. Individual risk models: models for individual claims, the sum of independent claims, approximations and their applications. | |
Unit-3 |
Teaching Hours:10 |
Survival Distribution and Life Tables
|
|
Uncertainty of age at death, survival function, time until death for a person, curate future lifetime, force of mortality, life tables with examples, deterministic survivorship group, life table characteristics, assumptions for fractional age, some analytical laws of mortality. | |
Unit-3 |
Teaching Hours:10 |
Survival Distribution and Life Tables
|
|
Uncertainty of age at death, survival function, time until death for a person, curate future lifetime, force of mortality, life tables with examples, deterministic survivorship group, life table characteristics, assumptions for fractional age, some analytical laws of mortality. | |
Unit-4 |
Teaching Hours:15 |
Life Insurance
|
|
Models for insurance payable at the moment of death, insurance payable at the end of the year of death and their relationships. Life annuities: continuous life annuities, discrete life annuities, life annuities with periodic payments. Premiums: continuous and discrete premiums. | |
Unit-4 |
Teaching Hours:15 |
Life Insurance
|
|
Models for insurance payable at the moment of death, insurance payable at the end of the year of death and their relationships. Life annuities: continuous life annuities, discrete life annuities, life annuities with periodic payments. Premiums: continuous and discrete premiums. | |
Text Books And Reference Books: 1. Corazza M, Legros F, Perna C and Sibillo M, Mathematical and Statistical Method for Actuarial Science and Finance, Springer, 2017. 2. Dickson C.M.D, Insurance Risk and Ruin, International Series on Actuarial Science, Cambridge University Press, 2016. | |
Essential Reading / Recommended Reading 1. CT-5 General Insurance, Life and health contingencies, Institute of Actuaries of India. 2. Mishra M.N and Mishra S.B, Insurance: Principles and Practice, 22nd edition, S. Chand Publications, 2016. 3. IC-02 (Revised), Practice of Life assurance, Insurance Institute of India. | |
Evaluation Pattern CIA 50% ESE 50% | |
STA541D - INTRODUCTION TO SPATIAL STATISTICS (2022 Batch) | |
Total Teaching Hours for Semester:45 |
No of Lecture Hours/Week:3 |
Max Marks:100 |
Credits:3 |
Course Objectives/Course Description |
|
This course designed as an application of statistics in geographical data analysis |
|
Learning Outcome |
|
CO1: Demonstrate the basic biological concepts in genetics
CO2: Infer the bioassays and their types CO3: Demonstrate the Feller's theorem and dose response estimation using regression models and dose allocation schemes. |
Unit-1 |
Teaching Hours:15 |
Introduction
|
|
Spatial Statistics, Geostatistics, Spatial Autocorrelation, Important properties of MC, Relationships between MC and GR, join count statistics, Graphic portrayals: the Moran scatterplot and the semi-variogram plot, Impacts of spatial autocorrelation, Testing for spatial autocorrelation in regression residuals. | |
Unit-1 |
Teaching Hours:15 |
Introduction
|
|
Spatial Statistics, Geostatistics, Spatial Autocorrelation, Important properties of MC, Relationships between MC and GR, join count statistics, Graphic portrayals: the Moran scatterplot and the semi-variogram plot, Impacts of spatial autocorrelation, Testing for spatial autocorrelation in regression residuals. | |
Unit-2 |
Teaching Hours:10 |
Spatial Sampling
|
|
Puerto Rico DEM data, Properties of the selected sampling design, Sampling simulation experiments on a unit square landscape, sampling simulation experiments on a hexagonal landscape structure, Spatial autocorrelation and effective sample size. | |
Unit-2 |
Teaching Hours:10 |
Spatial Sampling
|
|
Puerto Rico DEM data, Properties of the selected sampling design, Sampling simulation experiments on a unit square landscape, sampling simulation experiments on a hexagonal landscape structure, Spatial autocorrelation and effective sample size. | |
Unit-3 |
Teaching Hours:10 |
Spatial Composition and Configuration
|
|
Spatial heterogeneity, ANOVA, Testing for heterogeneity over a plan, regional supra-partitionings, direction supra-partitionings, Spatial weight metrics, Spatial heterogeneity. | |
Unit-3 |
Teaching Hours:10 |
Spatial Composition and Configuration
|
|
Spatial heterogeneity, ANOVA, Testing for heterogeneity over a plan, regional supra-partitionings, direction supra-partitionings, Spatial weight metrics, Spatial heterogeneity. | |
Unit-4 |
Teaching Hours:10 |
Spatial Regression
|
|
Linear regression, non-linear regression, Binomial/logistic regression, Poisson/negative binomial regression, simple kriging, universal kriging, simulated experiments. | |
Unit-4 |
Teaching Hours:10 |
Spatial Regression
|
|
Linear regression, non-linear regression, Binomial/logistic regression, Poisson/negative binomial regression, simple kriging, universal kriging, simulated experiments. | |
Text Books And Reference Books:
1. Yongan C, Griffith D.A, Spatial Statistics & Geostatistics: Theory and Applications for Geographic Information Science & Technology, Sage Publication, 2013.
2. Carlo G, Xavier G, Spatial Statistics and Modeling, Springer, 2010.
| |
Essential Reading / Recommended Reading 1. Van Lieshout M.N.M, Theory of Spatial Statistics: A Concise Introduction, CRC Press, 2019. 2. Kalkhan M.A, Spatial Statistics: GeoSpatial Information Modeling and Thematic Mapping, CRC Press, 2011. | |
Evaluation Pattern CIA 50% ESE 50% | |
STA551 - LINEAR REGRESSION MODELS PRACTICAL (2022 Batch) | |
Total Teaching Hours for Semester:30 |
No of Lecture Hours/Week:2 |
Max Marks:50 |
Credits:2 |
Course Objectives/Course Description |
|
The course is designed to provide a practical exposure to the students in Simple and Multiple linear Regression Analysis. |
|
Learning Outcome |
|
CO1: Demonstrate the fitting of linear regression models for the real time data CO2: Infer model adequacy through various model selection process. |
Unit-1 |
Teaching Hours:30 |
Practical assignments using R programming
|
|
1. Scatter Plots diagnosis. 2. Estimation of simple regression model. 3. Significance of simple linear regression. 4. Confidence Interval Estimation of simple linear regression. 5. Estimation of Multiple regression model. 6. Variable selection in multiple regression 7. Significance of multiple linear Regression. 8. Confidence interval for multiple linear Regression. 9. Residuals Plots, detection of outliers and their interpretation in simple and multiple linear regression. 10. Checking for Normality of Residuals. 11. Checking for Multicollinearity in simple and multiple linear regression. 12. Checking for Heteroscedasticity and auto-correlation in simple and multiple linear regression | |
Unit-1 |
Teaching Hours:30 |
Practical assignments using R programming
|
|
1. Scatter Plots diagnosis. 2. Estimation of simple regression model. 3. Significance of simple linear regression. 4. Confidence Interval Estimation of simple linear regression. 5. Estimation of Multiple regression model. 6. Variable selection in multiple regression 7. Significance of multiple linear Regression. 8. Confidence interval for multiple linear Regression. 9. Residuals Plots, detection of outliers and their interpretation in simple and multiple linear regression. 10. Checking for Normality of Residuals. 11. Checking for Multicollinearity in simple and multiple linear regression. 12. Checking for Heteroscedasticity and auto-correlation in simple and multiple linear regression | |
Text Books And Reference Books: Seema Acharya, Data Analytics Using R, CRC Press, Taylor & Francis Group, 2018. | |
Essential Reading / Recommended Reading Pardoe I, Applied Regression Modeling, John Wiley and Sons Inc, New York, 2012 | |
Evaluation Pattern CIA 50% ESE 50% | |
STA552A - SAMPLING TECHNIQUES PRACTICAL (2022 Batch) | |
Total Teaching Hours for Semester:30 |
No of Lecture Hours/Week:2 |
Max Marks:50 |
Credits:2 |
Course Objectives/Course Description |
|
The course is designed to provide a practical exposure to the students in application of different sampling techniques. |
|
Learning Outcome |
|
CO1: After completion of this course the students will acquire the knowledge on different sampling techniques CO2: After completion of this course the students will able to decide the application of different sampling techniques under different situation. CO3: After completion of this course the students will be able to design sampling procedures for various situations |
Unit-1 |
Teaching Hours:30 |
Practical Assignments using EXCEL/R:
|
|
1. Random sampling using Random number tables. 2. Concepts of unbiasedness, Variance, Mean square error etc. 3. Exercise on Simple Random Sampling with Replacement. 4. Exercise on Simple Random Sampling without Replacement. 5. Concepts of Simple Random Sampling for Attributes. 6. Exercise on Stratified Sampling. 7. Efficiency of stratified sampling over SRSWR and SRSWOR 8. Estimation of gain in precision due to stratification. 9. Exercise on Systematic sampling. 10. Efficiency of Systematic sampling over SRSWR and SRSWOR | |
Unit-1 |
Teaching Hours:30 |
Practical Assignments using EXCEL/R:
|
|
1. Random sampling using Random number tables. 2. Concepts of unbiasedness, Variance, Mean square error etc. 3. Exercise on Simple Random Sampling with Replacement. 4. Exercise on Simple Random Sampling without Replacement. 5. Concepts of Simple Random Sampling for Attributes. 6. Exercise on Stratified Sampling. 7. Efficiency of stratified sampling over SRSWR and SRSWOR 8. Estimation of gain in precision due to stratification. 9. Exercise on Systematic sampling. 10. Efficiency of Systematic sampling over SRSWR and SRSWOR | |
Text Books And Reference Books:
1. Gupta S.C and Kapoor V.K, Fundamentals of Applied Statistics, 4th Edition, Sultan Chand and Sons, India 2009. | |
Essential Reading / Recommended Reading
1. Arnab R, Survey Sampling Theory and Applications, Academic Press, UK, 2017. | |
Evaluation Pattern
CIA-50%
ESE-50% | |
STA552B - DESIGN OF EXPERIMENTS PRACTICAL (2022 Batch) | |
Total Teaching Hours for Semester:30 |
No of Lecture Hours/Week:2 |
Max Marks:50 |
Credits:2 |
Course Objectives/Course Description |
|
The course is designed to provide a practical exposure to the students for the various experimental designs. |
|
Learning Outcome |
|
CO1: Demonstrate the construction and analyses of various experimental designs using R programming. CO2: Demonstrate the efficiencies of various designs using R |
Unit-1 |
Teaching Hours:30 |
Practical assignments using R programming
|
|
1. Construction of ANOVA for one way classification 2. Construction of ANOVA for two way classification 3. Analysis of CRD 4. Analysis of RBD 5. Efficiency of RBD over CRD 6. Analysis of LSD 7. Efficiency of LSD over RBD 8. Efficiency of LSD over CRD 9. Analysis of 22 factorial experimental using RBD layout 10. Analysis of 23 factorial experimental using RBD layout 11. Analysis of 23 factorial experimental using RBD layout (Complete confounding) 12. Analysis of 23 factorial experimental using RBD layout (Partial confounding) | |
Unit-1 |
Teaching Hours:30 |
Practical assignments using R programming
|
|
1. Construction of ANOVA for one way classification 2. Construction of ANOVA for two way classification 3. Analysis of CRD 4. Analysis of RBD 5. Efficiency of RBD over CRD 6. Analysis of LSD 7. Efficiency of LSD over RBD 8. Efficiency of LSD over CRD 9. Analysis of 22 factorial experimental using RBD layout 10. Analysis of 23 factorial experimental using RBD layout 11. Analysis of 23 factorial experimental using RBD layout (Complete confounding) 12. Analysis of 23 factorial experimental using RBD layout (Partial confounding) | |
Text Books And Reference Books: 1. Seema Acharya, Data Analytics Using R, CRC Press, Taylor & Francis Group, 2018. | |
Essential Reading / Recommended Reading 1. Lawson J, Design and Analysis of Experiments with R, CRC Press, 2015. | |
Evaluation Pattern CIA 50% ESE 50% | |
STA552C - ACTUARIAL STATISTICS PRACTICAL (2022 Batch) | |
Total Teaching Hours for Semester:30 |
No of Lecture Hours/Week:2 |
Max Marks:50 |
Credits:2 |
Course Objectives/Course Description |
|
The course is designed to provide a practical exposure to the students in Actuarial Modeling. |
|
Learning Outcome |
|
CO1: To develop a deeper understanding of the premium and risk calculations of life insurance policies. CO2: To implement actuarial statistics in real life CO3: To construct new models using real-life concepts |
Unit-1 |
Teaching Hours:30 |
Practical assignments using EXCEL:
|
|
| |
Unit-1 |
Teaching Hours:30 |
Practical assignments using EXCEL:
|
|
| |
Text Books And Reference Books:
| |
Essential Reading / Recommended Reading
| |
Evaluation Pattern
CIA 50%
ESE 50% | |
STA552D - SPATIAL STATISTICS PRACTICAL (2022 Batch) | |
Total Teaching Hours for Semester:30 |
No of Lecture Hours/Week:2 |
Max Marks:50 |
Credits:2 |
Course Objectives/Course Description |
|
This course is designed to teach practical Spatial problems using statistical softwares. |
|
Learning Outcome |
|
CO1: Demonstrate practically evaluate Spatial Statistical models using R programming. |
Unit-1 |
Teaching Hours:30 |
Practical assignments using R programming:
|
|
1. Moran scatter plot 2. Semi-variogram plot 3. Estimation of Spatial Autocorrelation 4. Testing for spatial autocorrelation in regression residuals 5. Sampling simulation experiments on a unit square landscape 6. Sampling simulation experiments on a hexagonal landscape structure 7. Calculation of effective sample size 8. Spatial heterogeneity 9. Testing for heterogeneity over a plan: regional supra-partitionings 10. Testing for heterogeneity over a plan, direction supra-partitionings 11. Spatial Linear regression 12. Spatial Non-linear regression | |
Unit-1 |
Teaching Hours:30 |
Practical assignments using R programming:
|
|
1. Moran scatter plot 2. Semi-variogram plot 3. Estimation of Spatial Autocorrelation 4. Testing for spatial autocorrelation in regression residuals 5. Sampling simulation experiments on a unit square landscape 6. Sampling simulation experiments on a hexagonal landscape structure 7. Calculation of effective sample size 8. Spatial heterogeneity 9. Testing for heterogeneity over a plan: regional supra-partitionings 10. Testing for heterogeneity over a plan, direction supra-partitionings 11. Spatial Linear regression 12. Spatial Non-linear regression | |
Text Books And Reference Books: 1. Yongan C, Griffith D.A, Spatial Statistics & Geostatistics: Theory and Applications for Geographic Information Science & Technology, Sage Publication, 2013. 2. Carlo G, Xavier G, Spatial Statistics and Modelling, Springer, 2010. | |
Essential Reading / Recommended Reading 1. Van Lieshout M.N.M, Theory of Spatial Statistics: A Concise Introduction, CRC Press, 2019. 2. Kalkhan M.A, Spatial Statistics: GeoSpatial Information Modeling and Thematic Mapping, CRC Press, 2011. | |
Evaluation Pattern
CIA 50%
ESE 50% | |
CSC631 - DESIGN AND ANALYSIS OF ALGORITHMS (2022 Batch) | |
Total Teaching Hours for Semester:45 |
No of Lecture Hours/Week:3 |
Max Marks:100 |
Credits:3 |
Course Objectives/Course Description |
|
Understand the concept of a design and develop algorithm, mathematical aspects and analysis of algorithm, sort and search algorithms, various algorithmic techniques, and design methods. |
|
Learning Outcome |
|
CO1: Understand the concept of a design and develop algorithm, CO2: Design and develop algorithm, mathematical aspects and analysis of algorithm CO3: sort and search algorithms, various algorithmic techniques, and design methods. |
Unit-1 |
Teaching Hours:7 |
Introduction
|
|
Algorithm-definition, Specification- pseudo code conventions, recursive algorithms, Performance analysis – space complexity, time complexity, asymptotic notation, practical complexities, performance measurement, Randomized algorithms- basics of probability theory, identifying the repeated element, primality testing, advantages and disadvantages. | |
Unit-1 |
Teaching Hours:7 |
Introduction
|
|
Algorithm-definition, Specification- pseudo code conventions, recursive algorithms, Performance analysis – space complexity, time complexity, asymptotic notation, practical complexities, performance measurement, Randomized algorithms- basics of probability theory, identifying the repeated element, primality testing, advantages and disadvantages. | |
Unit-1 |
Teaching Hours:7 |
Introduction
|
|
Algorithm-definition, Specification- pseudo code conventions, recursive algorithms, Performance analysis – space complexity, time complexity, asymptotic notation, practical complexities, performance measurement, Randomized algorithms- basics of probability theory, identifying the repeated element, primality testing, advantages and disadvantages. | |
Unit-2 |
Teaching Hours:8 |
Elementary Data Structures
|
|
Stacks and queues, Trees- terminology, binary trees, Dictionaries- binary search trees, cost amortization, Priority queues- heaps, heap sort, Sets and disjoint Set Union-union and find operations, Graphs-definitions, representations. | |
Unit-2 |
Teaching Hours:8 |
Elementary Data Structures
|
|
Stacks and queues, Trees- terminology, binary trees, Dictionaries- binary search trees, cost amortization, Priority queues- heaps, heap sort, Sets and disjoint Set Union-union and find operations, Graphs-definitions, representations. | |
Unit-2 |
Teaching Hours:8 |
Elementary Data Structures
|
|
Stacks and queues, Trees- terminology, binary trees, Dictionaries- binary search trees, cost amortization, Priority queues- heaps, heap sort, Sets and disjoint Set Union-union and find operations, Graphs-definitions, representations. | |
Unit-3 |
Teaching Hours:8 |
Divide and Conquer
|
|
General method, Binary search, Finding the maximum and minimum, Merge sort, quick sort-performance measurement | |
Unit-3 |
Teaching Hours:8 |
Divide and Conquer
|
|
General method, Binary search, Finding the maximum and minimum, Merge sort, quick sort-performance measurement | |
Unit-3 |
Teaching Hours:8 |
Divide and Conquer
|
|
General method, Binary search, Finding the maximum and minimum, Merge sort, quick sort-performance measurement | |
Unit-4 |
Teaching Hours:12 |
Greedy Method & Dynamic Programming
|
|
The general method, Knapsack problem, Minimum cost spanning trees- Prim’s algorithm, Kruskal’s algorithm, Single-source shortest paths, Dynamic Programming: The general method, Multistage graphs, All pairs shortest paths, - -optimal binary search trees - The traveling salesperson problem. | |
Unit-4 |
Teaching Hours:12 |
Greedy Method & Dynamic Programming
|
|
The general method, Knapsack problem, Minimum cost spanning trees- Prim’s algorithm, Kruskal’s algorithm, Single-source shortest paths, Dynamic Programming: The general method, Multistage graphs, All pairs shortest paths, - -optimal binary search trees - The traveling salesperson problem. | |
Unit-4 |
Teaching Hours:12 |
Greedy Method & Dynamic Programming
|
|
The general method, Knapsack problem, Minimum cost spanning trees- Prim’s algorithm, Kruskal’s algorithm, Single-source shortest paths, Dynamic Programming: The general method, Multistage graphs, All pairs shortest paths, - -optimal binary search trees - The traveling salesperson problem. | |
Unit-5 |
Teaching Hours:10 |
Backtracking & Branch And Bound
|
|
Backtracking- The general method, The 8-queens problem, sum of subsets, graph coloring Hamiltonian cycles. , Branch and Bound: Least cost search, Bounding, FIFO Branch and bound, LC branch and bound, Knapsack problem, Traveling salesperson problem. | |
Unit-5 |
Teaching Hours:10 |
Backtracking & Branch And Bound
|
|
Backtracking- The general method, The 8-queens problem, sum of subsets, graph coloring Hamiltonian cycles. , Branch and Bound: Least cost search, Bounding, FIFO Branch and bound, LC branch and bound, Knapsack problem, Traveling salesperson problem. | |
Unit-5 |
Teaching Hours:10 |
Backtracking & Branch And Bound
|
|
Backtracking- The general method, The 8-queens problem, sum of subsets, graph coloring Hamiltonian cycles. , Branch and Bound: Least cost search, Bounding, FIFO Branch and bound, LC branch and bound, Knapsack problem, Traveling salesperson problem. | |
Text Books And Reference Books:
[1] Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran, Fundamentals of computer algorithms, Galgotia Publications, 2007. | |
Essential Reading / Recommended Reading [1] Sara Baase and Allen VanGelder, Computer Algorithms Introduction to design and Analysis, Third edition, Pearson education, 2004. | |
Evaluation Pattern CIA - 50% ESE - 50% | |
CSC641A - INTRODUCTION TO SOFT COMPUTING (2022 Batch) | |
Total Teaching Hours for Semester:45 |
No of Lecture Hours/Week:3 |
Max Marks:100 |
Credits:3 |
Course Objectives/Course Description |
|
The main objective of this course is to provide fundamental knowledge of soft computing techniques.On successful completion of the course,students will acquire fundamental knowledge of artificial neural network, fuzzy Logic and genetic algorithms. |
|
Learning Outcome |
|
CO1: Describe the structure of artificial neural network and Biological neural network. CO2: Demonstrate various artificial neural network models,supervised,unsupervised and reinforcement learning methods. CO3: Apply Perceptron (Single and Multiple output classes) and Back propagation algorithm in real time applications. |
Unit-1 |
Teaching Hours:9 |
Introduction to Soft Computing
|
|
Neural Networks-Application Scope of Neural Networks-Fuzzy Logic-Genetic Algorithm-Soft Computing. Introduction to Artificial Neural Networks Fundamental Concept of ANN: The Artificial Neural Network-Biological Neural Network-Comparison between Biological Neuron and Artificial Neuron-Evolution of Neural Network.
| |
Unit-1 |
Teaching Hours:9 |
Introduction to Soft Computing
|
|
Neural Networks-Application Scope of Neural Networks-Fuzzy Logic-Genetic Algorithm-Soft Computing. Introduction to Artificial Neural Networks Fundamental Concept of ANN: The Artificial Neural Network-Biological Neural Network-Comparison between Biological Neuron and Artificial Neuron-Evolution of Neural Network.
| |
Unit-2 |
Teaching Hours:9 |
Basic Models of ANN
|
|
Connections-Learning-Supervised Learning-Unsupervised Learning-Reinforcement Learning-Activation Functions Important Terminologies of ANN- Weights, Bias, Threshold, Learning Rate, Momentum Factor, Vigilance Parameter, Notations. | |
Unit-2 |
Teaching Hours:9 |
Basic Models of ANN
|
|
Connections-Learning-Supervised Learning-Unsupervised Learning-Reinforcement Learning-Activation Functions Important Terminologies of ANN- Weights, Bias, Threshold, Learning Rate, Momentum Factor, Vigilance Parameter, Notations. | |
Unit-3 |
Teaching Hours:9 |
Supervised Learning Network
|
|
Perceptron Networks-Theory-Perceptron Learning Rule-Architecture-Flowchart for training Process-Perceptron Training Algorithm for Single and Multiple Output Classes. Back Propagation Network- Theory-Architecture-Flowchart for training process-Training Algorithm-Learning Factors for Back-Propagation Network. Radial Basis Function Network RBFN: Theory, Architecture, Flowchart and Algorithm. | |
Unit-3 |
Teaching Hours:9 |
Supervised Learning Network
|
|
Perceptron Networks-Theory-Perceptron Learning Rule-Architecture-Flowchart for training Process-Perceptron Training Algorithm for Single and Multiple Output Classes. Back Propagation Network- Theory-Architecture-Flowchart for training process-Training Algorithm-Learning Factors for Back-Propagation Network. Radial Basis Function Network RBFN: Theory, Architecture, Flowchart and Algorithm. | |
Unit-4 |
Teaching Hours:9 |
Introduction to Fuzzy Logic and Sets
|
|
Introduction to Fuzzy Logic - Fuzzy Sets – Fuzzy set operations- properties of Fuzzy sets. Fuzzy Relations: cardinality-operations and properties of fuzzy relations-fuzzy composition. Fuzzy membership functions -Features of membership functions- Fuzzification- Methods of Membership value assignments. | |
Unit-4 |
Teaching Hours:9 |
Introduction to Fuzzy Logic and Sets
|
|
Introduction to Fuzzy Logic - Fuzzy Sets – Fuzzy set operations- properties of Fuzzy sets. Fuzzy Relations: cardinality-operations and properties of fuzzy relations-fuzzy composition. Fuzzy membership functions -Features of membership functions- Fuzzification- Methods of Membership value assignments. | |
Unit-5 |
Teaching Hours:9 |
Genetic Algorithm
|
|
Introduction to Genetic Algorithm-Biological Background-Genetic Algorithm and Search Space-Genetic Algorithm vs Traditional Algorithms-Basic Terminologies in Genetic Algorithm-Simple GA-General Genetic Algorithm | |
Unit-5 |
Teaching Hours:9 |
Genetic Algorithm
|
|
Introduction to Genetic Algorithm-Biological Background-Genetic Algorithm and Search Space-Genetic Algorithm vs Traditional Algorithms-Basic Terminologies in Genetic Algorithm-Simple GA-General Genetic Algorithm | |
Text Books And Reference Books: [1] S.N.Sivanandam, S. N. Deepa, Principles of Soft Computing, Wiley-India, 3rd Edition, 2018. [2]S.N.Sivanandam,S. Sumathi, S.N.Deepa, Introduction to Neural Networks using MATLAB 6.0,Tata McGraw-Hill, New Delhi, 2010. | |
Essential Reading / Recommended Reading [1] Satish Kumar, Neural Networks – A Classroom approach, Tata McGraw-Hill, New Delhi,2007. [2] Martin T. Hagan, Howard B. Demuth, Mark Beale, Neural Network Design, Thomson Learning, India, 2002. [3] Simon Haykin, Neural Networks, PHI,2nd Edition,2005. [4] Ethem Alpaydin, Introduction To Machine Learning, PHI, 2005. [5] J.S.R. Jang, C.T.Sun, E.Mizutani, Neuro-Fuzzy and Soft Computing, PHI, 2012. | |
Evaluation Pattern CIA – 50 % ESE - 50 %
| |
CSC641B - CLOUD COMPUTING (2022 Batch) | |
Total Teaching Hours for Semester:45 |
No of Lecture Hours/Week:3 |
Max Marks:100 |
Credits:3 |
Course Objectives/Course Description |
|
This course covers a series of current cloud computing technologies, including technologies for Infrastructure as a Service, Platform as a Service, Software as a Service, and Physical Systems as a Service. For different layers of the cloud technologies, practical solutions such as Google, Amazon, Microsoft,SalesForce.com. |
|
Learning Outcome |
|
CO1: Understand the series of current cloud computing technologies CO2: Demonstrate technologies for Infrastructure as a Service, Platform as a Service, Software as a Service, and Physical Systems as a Service. CO3: Analyze different layers of the cloud technologies, practical solutions such as Google, Amazon, Microsoft, SalesForce.com. |
Unit-1 |
Teaching Hours:7 |
Introduction
|
|
The vision of cloud computing - Characteristics and benefits - Challenges ahead - Historical developments - Distributed systems - Virtualization - Building cloud computing environments - Application development - Infrastructure and system development - Computing platforms andtechnologies. | |
Unit-1 |
Teaching Hours:7 |
Introduction
|
|
The vision of cloud computing - Characteristics and benefits - Challenges ahead - Historical developments - Distributed systems - Virtualization - Building cloud computing environments - Application development - Infrastructure and system development - Computing platforms andtechnologies. | |
Unit-1 |
Teaching Hours:7 |
Introduction
|
|
The vision of cloud computing - Characteristics and benefits - Challenges ahead - Historical developments - Distributed systems - Virtualization - Building cloud computing environments - Application development - Infrastructure and system development - Computing platforms andtechnologies. | |
Unit-2 |
Teaching Hours:10 |
Principles of Parallel computing and Virtualization
|
|
Principles of Parallel Computing – Parallel vs. distributed computing - Elements of parallel computing - Hardware architectures for parallel processing Approaches to parallel programming - Laws of caution. Introduction to virtualization - Characteristics of virtualized environments - Taxonomy of virtualization techniques – Hardware Virtualization - Virtualization and cloud computing - Pros and cons of virtualization. | |
Unit-2 |
Teaching Hours:10 |
Principles of Parallel computing and Virtualization
|
|
Principles of Parallel Computing – Parallel vs. distributed computing - Elements of parallel computing - Hardware architectures for parallel processing Approaches to parallel programming - Laws of caution. Introduction to virtualization - Characteristics of virtualized environments - Taxonomy of virtualization techniques – Hardware Virtualization - Virtualization and cloud computing - Pros and cons of virtualization. | |
Unit-2 |
Teaching Hours:10 |
Principles of Parallel computing and Virtualization
|
|
Principles of Parallel Computing – Parallel vs. distributed computing - Elements of parallel computing - Hardware architectures for parallel processing Approaches to parallel programming - Laws of caution. Introduction to virtualization - Characteristics of virtualized environments - Taxonomy of virtualization techniques – Hardware Virtualization - Virtualization and cloud computing - Pros and cons of virtualization. | |
Unit-3 |
Teaching Hours:9 |
Cloud Computing Architecture
|
|
The Cloud reference model – Architecture – Types of Cloud – Public Cloud – Private Cloud – Hybrid Cloud – Community Cloud – Economies of the cloud. | |
Unit-3 |
Teaching Hours:9 |
Cloud Computing Architecture
|
|
The Cloud reference model – Architecture – Types of Cloud – Public Cloud – Private Cloud – Hybrid Cloud – Community Cloud – Economies of the cloud. | |
Unit-3 |
Teaching Hours:9 |
Cloud Computing Architecture
|
|
The Cloud reference model – Architecture – Types of Cloud – Public Cloud – Private Cloud – Hybrid Cloud – Community Cloud – Economies of the cloud. | |
Unit-4 |
Teaching Hours:10 |
Cloud Platforms in Industry
|
|
Amazon web services: Compute services - Storage services - Communication services - Additional services. Google AppEngine: Architecture and core concepts - Application life cycle - Cost model – Observations. Microsoft azure: Azure core concepts - SQL azure - Windows azure platform appliance. | |
Unit-4 |
Teaching Hours:10 |
Cloud Platforms in Industry
|
|
Amazon web services: Compute services - Storage services - Communication services - Additional services. Google AppEngine: Architecture and core concepts - Application life cycle - Cost model – Observations. Microsoft azure: Azure core concepts - SQL azure - Windows azure platform appliance. | |
Unit-4 |
Teaching Hours:10 |
Cloud Platforms in Industry
|
|
Amazon web services: Compute services - Storage services - Communication services - Additional services. Google AppEngine: Architecture and core concepts - Application life cycle - Cost model – Observations. Microsoft azure: Azure core concepts - SQL azure - Windows azure platform appliance. | |
Unit-5 |
Teaching Hours:9 |
Data in the cloud and Cloud Applications
|
|
Data in the cloud: Relational databases - Cloud file systems: GFS and HDFS - BigTable, HBase - Cloud data stores: Datastore and SimpleDB Cloud Application: Healthcare: ECG analysis in the cloud - Biology: protein structure prediction - Biology: gene expression data analysis for cancer diagnosis - Geoscience: satellite image processing.
| |
Unit-5 |
Teaching Hours:9 |
Data in the cloud and Cloud Applications
|
|
Data in the cloud: Relational databases - Cloud file systems: GFS and HDFS - BigTable, HBase - Cloud data stores: Datastore and SimpleDB Cloud Application: Healthcare: ECG analysis in the cloud - Biology: protein structure prediction - Biology: gene expression data analysis for cancer diagnosis - Geoscience: satellite image processing.
| |
Unit-5 |
Teaching Hours:9 |
Data in the cloud and Cloud Applications
|
|
Data in the cloud: Relational databases - Cloud file systems: GFS and HDFS - BigTable, HBase - Cloud data stores: Datastore and SimpleDB Cloud Application: Healthcare: ECG analysis in the cloud - Biology: protein structure prediction - Biology: gene expression data analysis for cancer diagnosis - Geoscience: satellite image processing.
| |
Text Books And Reference Books: [1] RajkumarBuyya, Christian Vecchiola and S. ThamaraiSelvi ―Mastering Cloud Computing” - Foundations and Applications Programming , MK publications, 2013. | |
Essential Reading / Recommended Reading [1] Michael J.Kavis, “Architecting the Cloud: Design Decisions for Cloud Computing Service Models SaaS, PaaS, and IaaS‖, John Wiley & Sons Inc., Jan 2014.
| |
Evaluation Pattern CIA: 50% ESE: 50% | |
CSC641C - COMPUTER ARCHITECTURE (2022 Batch) | |
Total Teaching Hours for Semester:45 |
No of Lecture Hours/Week:3 |
Max Marks:100 |
Credits:3 |
Course Objectives/Course Description |
|
This course deals with concepts and models of computer peripherals. It explains a set of disciplines that describes a computer system by specifying its parts and their relations. The course provides insights into the basic design of an ALU, the memory design, the various operations performed. |
|
Learning Outcome |
|
CO1: Understand the evolution of computer hardware to meet the needs of multi-processing systems. CO2: Demonstrate the basic computer organization & design and state the significant components in CPU.
CO3: Implement computer arithmetic algorithms and explain the input-output organization. |
Unit-1 |
Teaching Hours:7 |
Introduction
|
|
Basic Model of a Computer, Computer Components, Register transfer and Micro operations: Register Transfer Language ,Register Transfer , Bus and Memory Transfers, Arithmetic Micro operations , Logic Micro operations , Shift Micro operations, Arithmetic Logic and ShiftUnit. | |
Unit-1 |
Teaching Hours:7 |
Introduction
|
|
Basic Model of a Computer, Computer Components, Register transfer and Micro operations: Register Transfer Language ,Register Transfer , Bus and Memory Transfers, Arithmetic Micro operations , Logic Micro operations , Shift Micro operations, Arithmetic Logic and ShiftUnit. | |
Unit-2 |
Teaching Hours:9 |
Basic Computer organization and design
|
|
Instruction codes, Computer registers, Computer Instruction, Timing and control, Instruction cycle, Memory reference instructions, Input output and Interrupt, Design of basic computer, Design of Accumulator logic. | |
Unit-2 |
Teaching Hours:9 |
Basic Computer organization and design
|
|
Instruction codes, Computer registers, Computer Instruction, Timing and control, Instruction cycle, Memory reference instructions, Input output and Interrupt, Design of basic computer, Design of Accumulator logic. | |
Unit-3 |
Teaching Hours:9 |
Central Processing Unit
|
|
Introduction, General Register Organization, Stacks organizations-Register stack, Memory stack, Instruction formats- Three address instruction, two address instruction, one address instruction, zero address instruction , Addressing modes, Data transfer and manipulation- Data transfer instructions, Data manipulationinstructions. | |
Unit-3 |
Teaching Hours:9 |
Central Processing Unit
|
|
Introduction, General Register Organization, Stacks organizations-Register stack, Memory stack, Instruction formats- Three address instruction, two address instruction, one address instruction, zero address instruction , Addressing modes, Data transfer and manipulation- Data transfer instructions, Data manipulationinstructions. | |
Unit-4 |
Teaching Hours:10 |
Computer Arithmetic
|
|
Introduction ,Addition and Subtraction – Addition and subtraction with signed magnitude data, addition and subtraction with signed 2’s complement data ,Multiplication Algorithms- Signed magnitude ,Booth multiplication algorithm, array multiplier ,Division Algorithms- signed magnitudealgorithm. | |
Unit-4 |
Teaching Hours:10 |
Computer Arithmetic
|
|
Introduction ,Addition and Subtraction – Addition and subtraction with signed magnitude data, addition and subtraction with signed 2’s complement data ,Multiplication Algorithms- Signed magnitude ,Booth multiplication algorithm, array multiplier ,Division Algorithms- signed magnitudealgorithm. | |
Unit-5 |
Teaching Hours:10 |
Input Output Organization
|
|
Peripheral Device, Input Output Interface – I/O bus and interface modules, I/O versus memory bus, Asynchronous data transfer, Modes of transfer – programmed I/O , Interrupt initiated I/O, , Direct Memory Access – DMA controller and DMAtransfer.
| |
Unit-5 |
Teaching Hours:10 |
Input Output Organization
|
|
Peripheral Device, Input Output Interface – I/O bus and interface modules, I/O versus memory bus, Asynchronous data transfer, Modes of transfer – programmed I/O , Interrupt initiated I/O, , Direct Memory Access – DMA controller and DMAtransfer.
| |
Text Books And Reference Books: [1] Mano M Morris, Computer System Architecture, PHI, 3rd Edition,2008. | |
Essential Reading / Recommended Reading [1] Stalling, Williams. Computer Organization and Architecture, 7th Edition, 2010. [2] Hayes, John P, Computer Architecture and Organization, 3rd Edition, McGraw-Hill, 2008. | |
Evaluation Pattern CIA-50% ESE-50% | |
CSC641D - OOAD USING UML (2022 Batch) | |
Total Teaching Hours for Semester:60 |
No of Lecture Hours/Week:4 |
Max Marks:100 |
Credits:4 |
Course Objectives/Course Description |
|
The course provides instruction and practical experience focusing on the effective use of object-oriented methodology life cycle models and the judicious use of software modelling as applied to a software development process. |
|
Learning Outcome |
|
CO1: Understand the object oriented life cycle. CO2: Know how to identify classes, objects, relationships. CO3: Learn the Object Oriented Design process. CO4: Understand about software quality and usability. CO5: Build model use case diagrams. |
Unit-1 |
Teaching Hours:12 |
|||
Complexity
|
||||
| ||||
Unit-1 |
Teaching Hours:12 |
|||
Complexity
|
||||
| ||||
Unit-2 |
Teaching Hours:10 |
|||
Classes and Objects
|
||||
The Nature of an Object, Relationship among objects, nature of a class, Relationship among classes. | ||||
Unit-2 |
Teaching Hours:10 |
|||
Classes and Objects
|
||||
The Nature of an Object, Relationship among objects, nature of a class, Relationship among classes. | ||||
Unit-3 |
Teaching Hours:8 |
|||
Introduction to Modeling and UML
|
||||
Importance of modeling, principles of modeling, object oriented modeling, overview of UML conceptual model of the UML, Architecture. | ||||
Unit-3 |
Teaching Hours:8 |
|||
Introduction to Modeling and UML
|
||||
Importance of modeling, principles of modeling, object oriented modeling, overview of UML conceptual model of the UML, Architecture. | ||||
Unit-4 |
Teaching Hours:10 |
|||
Basic Structural Modeling
|
||||
| ||||
Unit-4 |
Teaching Hours:10 |
|||
Basic Structural Modeling
|
||||
| ||||
Unit-5 |
Teaching Hours:10 |
|||
Basic Behavioral Modeling
|
||||
| ||||
Unit-5 |
Teaching Hours:10 |
|||
Basic Behavioral Modeling
|
||||
| ||||
Unit-6 |
Teaching Hours:10 |
|||
Architectural Modeling
|
||||
| ||||
Unit-6 |
Teaching Hours:10 |
|||
Architectural Modeling
|
||||
| ||||
Text Books And Reference Books: [1] Michael Blaha,JamesRumbaugh, Object Oriented Modeling and Design with UML, 2nd Edition, Pearson, 2010. | ||||
Essential Reading / Recommended Reading [1] Grady Booch, Robert A.Makimchul,MichaelW.EagelJimConallen,Kelli A. Houston, Object Oriented Analysis and Design with Applications, 3rd Edition, Pearson Education Inc,2013. [2] Grady Booch, James Rumbaugh, Ivar Jacobson, The Unified Modeling Language User Guide, 2nd Edition, Pearson Education Inc,2013. | ||||
Evaluation Pattern CIA - 50% ESE - 50% | ||||
CSC641E - USER EXPERIENCE DESIGN(UX) (2022 Batch) | ||||
Total Teaching Hours for Semester:45 |
No of Lecture Hours/Week:3 |
|||
Max Marks:100 |
Credits:3 |
|||
Course Objectives/Course Description |
||||
The UI/UX course provides a great entry point for those who want to pursue a career in the user interface design and development. Student will learn the core principles of visual design, including building storyboards, choosing color schemes and visualizing the ideal user interface to improve the user experience. This course will help to create intuitive and great- looking software products that users will love, and boost company’s ability to persuade audiences into becomingbuyers. |
||||
Learning Outcome |
||||
CO1: Describe design principles. CO2: Demonstrate impactful visual design and color concepts. CO3: Apply design principles and skills for design prototype. CO4: Design an intuitive design for software products. |
Unit-1 |
Teaching Hours:9 |
Introduction
|
|
HCI-Human computer Interaction-Fundamentals of Design-people and design-Visual Design-overview -difference between visual & UI/UX, UI design trends, Roles of a UI designer, UI UX process-UX- UX terminologies-elements-layers-roles-user centered vs. value-centered design-usertypes. | |
Unit-1 |
Teaching Hours:9 |
Introduction
|
|
HCI-Human computer Interaction-Fundamentals of Design-people and design-Visual Design-overview -difference between visual & UI/UX, UI design trends, Roles of a UI designer, UI UX process-UX- UX terminologies-elements-layers-roles-user centered vs. value-centered design-usertypes. | |
Unit-2 |
Teaching Hours:9 |
Principles
|
|
Visual Communication-Design principles-Design elements-Color theory-Typography | |
Unit-2 |
Teaching Hours:9 |
Principles
|
|
Visual Communication-Design principles-Design elements-Color theory-Typography | |
Unit-3 |
Teaching Hours:9 |
User Experience (UX)
|
|
What makes an experience-the cost of overlooking your users-a balanced approach to solving problems-involving users to perfect your product-good and bad user experiences-Understand the business problem- understand the user context- making sense of what you have found- prototype the solution –test learn tweak.Iterate. | |
Unit-3 |
Teaching Hours:9 |
User Experience (UX)
|
|
What makes an experience-the cost of overlooking your users-a balanced approach to solving problems-involving users to perfect your product-good and bad user experiences-Understand the business problem- understand the user context- making sense of what you have found- prototype the solution –test learn tweak.Iterate. | |
Unit-4 |
Teaching Hours:9 |
Designing for Voice User Interfaces
|
|
Introduction-History-what is VUI designer?-chat bots-Basic Voice user interface design principles-designing for mobile devices verses IVR systems-conventional design-error handling-personas, avtars, actor and video games-Speech Recognition Technology-Advanced Voice User Interface Design-User testing. Hands on reference Amazon Alexa, Google Dialogflow | |
Unit-4 |
Teaching Hours:9 |
Designing for Voice User Interfaces
|
|
Introduction-History-what is VUI designer?-chat bots-Basic Voice user interface design principles-designing for mobile devices verses IVR systems-conventional design-error handling-personas, avtars, actor and video games-Speech Recognition Technology-Advanced Voice User Interface Design-User testing. Hands on reference Amazon Alexa, Google Dialogflow | |
Unit-5 |
Teaching Hours:9 |
Case Study / Tools / Design Lab
|
|
Case study based on domain-web-mobile-product interaction-software tools-mockups- interactive design. Learn through cheat-sheets- Invision-AdobeXD-Sketch-UXPin-FluidUI- Portfolio creation through behance.net | |
Unit-5 |
Teaching Hours:9 |
Case Study / Tools / Design Lab
|
|
Case study based on domain-web-mobile-product interaction-software tools-mockups- interactive design. Learn through cheat-sheets- Invision-AdobeXD-Sketch-UXPin-FluidUI- Portfolio creation through behance.net | |
Text Books And Reference Books: [1] DonalsChesnut,KevinPNichols,“UXforDummies”,JohnwileyandSons,2014 [2] Jodie Moule, “KILLER UX Design”, Site point , Shroff Publishers, 2015 ISBN: 978:93:5213:175-4 [3] CathyPearl, “Designing Voice User Interfaces”, O’Reilly Media Inc, 2017, ISBN : 978- 93-5213-526-4 | |
Essential Reading / Recommended Reading [1] DonaldA.Norman,BasicBooks,"TheDesignofEverydayThings",Inc.NewYork,NY, USA ©2002 ISBN: 9780465067107 [2] Krug, Steve, “Don't Make Me Think, Revisited : a Common Sense Approach to Web Usability”, [Berkeley, Calif.] : New Riders, 2014.Print [3] William lidwell, Kritina Holden,Jill Butler, “Universal Principles of Design”, Rockport Publishers, 2010, ISBN-13: 978-1-592453-587-3,ISBN-10:1-59253-587-9. | |
Evaluation Pattern CIA : 50 ESE : 50 | |
CSC681 - MAIN PROJECT (2022 Batch) | |
Total Teaching Hours for Semester:60 |
No of Lecture Hours/Week:4 |
Max Marks:100 |
Credits:4 |
Course Objectives/Course Description |
|
The main aim of this course is to develop practical knowledge of the students on building a project using any of their interested concepts. Students identifies real world problem, design and develop the project. |
|
Learning Outcome |
|
CO1: Identify the problem and understand the practical concepts to develop project CO2: Analyse the problem to find the solutions as per the requirement. CO3: Create a working project that satisfies the need of the end user. |
Unit-1 |
Teaching Hours:60 |
MAIN PROJECT
|
|
This main project helps the student to apply the concepts which they have learnt in the previous semesters. Students can use any modern technology or tool for their project. Student has to identify and understand the real world problems in consultation with the guide to select the project. Students will be divided into batches, each batch containing not more than 3 students. | |
Unit-1 |
Teaching Hours:60 |
MAIN PROJECT
|
|
This main project helps the student to apply the concepts which they have learnt in the previous semesters. Students can use any modern technology or tool for their project. Student has to identify and understand the real world problems in consultation with the guide to select the project. Students will be divided into batches, each batch containing not more than 3 students. | |
Unit-1 |
Teaching Hours:60 |
MAIN PROJECT
|
|
This main project helps the student to apply the concepts which they have learnt in the previous semesters. Students can use any modern technology or tool for their project. Student has to identify and understand the real world problems in consultation with the guide to select the project. Students will be divided into batches, each batch containing not more than 3 students. | |
Text Books And Reference Books: - | |
Essential Reading / Recommended Reading - | |
Evaluation Pattern CIA:50% ESE:50% | |
MAT631 - COMPLEX ANALYSIS (2022 Batch) | |
Total Teaching Hours for Semester:45 |
No of Lecture Hours/Week:3 |
Max Marks:100 |
Credits:3 |
Course Objectives/Course Description |
|
Course description: This course enables the students to understand the basic theory and principles of complex analysis. COBJ1. understand the theory and geometry of complex numbers. COBJ2. evaluate derivatives and integrals of functions of complex variables. COBJ3. examine the transformation of functions of complex variables. COBJ4. obtain the power series expansion of a complex valued function. |
|
Learning Outcome |
|
CO1: On successful completion of the course, the students should be able to understand the concepts of limit, continuity, differentiability of complex functions. CO2: On successful completion of the course, the students should be able to evaluate the integrals of complex functions using Cauchy's Integral Theorem/Formula and related results. CO3: On successful completion of the course, the students should be able to examine various types of transformation of functions of complex variables. CO4: On successful completion of the course, the students should be able to demonstrate the expansions of complex functions as Taylor, Power and Laurent Series, Classify singularities and poles. CO5: On successful completion of the course, the students should be able to apply the concepts of complex analysis to analyze and address real world problems. |
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Analytic Functions
|
|||||||||||||||||||||||||||||
Properties of complex numbers, regions in the complex plane, functions of complex variable, limits, limits involving the point at infinity, continuity and differentiability of functions of complex variable. Analytic functions, necessary and sufficient conditions for a function to be analytic. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Analytic Functions
|
|||||||||||||||||||||||||||||
Properties of complex numbers, regions in the complex plane, functions of complex variable, limits, limits involving the point at infinity, continuity and differentiability of functions of complex variable. Analytic functions, necessary and sufficient conditions for a function to be analytic. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Analytic Functions
|
|||||||||||||||||||||||||||||
Properties of complex numbers, regions in the complex plane, functions of complex variable, limits, limits involving the point at infinity, continuity and differentiability of functions of complex variable. Analytic functions, necessary and sufficient conditions for a function to be analytic. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Analytic Functions
|
|||||||||||||||||||||||||||||
Properties of complex numbers, regions in the complex plane, functions of complex variable, limits, limits involving the point at infinity, continuity and differentiability of functions of complex variable. Analytic functions, necessary and sufficient conditions for a function to be analytic. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Analytic Functions
|
|||||||||||||||||||||||||||||
Properties of complex numbers, regions in the complex plane, functions of complex variable, limits, limits involving the point at infinity, continuity and differentiability of functions of complex variable. Analytic functions, necessary and sufficient conditions for a function to be analytic. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Analytic Functions
|
|||||||||||||||||||||||||||||
Properties of complex numbers, regions in the complex plane, functions of complex variable, limits, limits involving the point at infinity, continuity and differentiability of functions of complex variable. Analytic functions, necessary and sufficient conditions for a function to be analytic. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Analytic Functions
|
|||||||||||||||||||||||||||||
Properties of complex numbers, regions in the complex plane, functions of complex variable, limits, limits involving the point at infinity, continuity and differentiability of functions of complex variable. Analytic functions, necessary and sufficient conditions for a function to be analytic. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Complex Integration and Conformal Mapping
|
|||||||||||||||||||||||||||||
Definite integrals of functions, contour integrals and its examples, Cauchy’s integral theorem, Cauchy integral formula, Liouville’s theorem and the fundamental theorem of algebra, elementary transformations, conformal mappings, bilinear transformations. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Complex Integration and Conformal Mapping
|
|||||||||||||||||||||||||||||
Definite integrals of functions, contour integrals and its examples, Cauchy’s integral theorem, Cauchy integral formula, Liouville’s theorem and the fundamental theorem of algebra, elementary transformations, conformal mappings, bilinear transformations. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Complex Integration and Conformal Mapping
|
|||||||||||||||||||||||||||||
Definite integrals of functions, contour integrals and its examples, Cauchy’s integral theorem, Cauchy integral formula, Liouville’s theorem and the fundamental theorem of algebra, elementary transformations, conformal mappings, bilinear transformations. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Complex Integration and Conformal Mapping
|
|||||||||||||||||||||||||||||
Definite integrals of functions, contour integrals and its examples, Cauchy’s integral theorem, Cauchy integral formula, Liouville’s theorem and the fundamental theorem of algebra, elementary transformations, conformal mappings, bilinear transformations. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Complex Integration and Conformal Mapping
|
|||||||||||||||||||||||||||||
Definite integrals of functions, contour integrals and its examples, Cauchy’s integral theorem, Cauchy integral formula, Liouville’s theorem and the fundamental theorem of algebra, elementary transformations, conformal mappings, bilinear transformations. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Complex Integration and Conformal Mapping
|
|||||||||||||||||||||||||||||
Definite integrals of functions, contour integrals and its examples, Cauchy’s integral theorem, Cauchy integral formula, Liouville’s theorem and the fundamental theorem of algebra, elementary transformations, conformal mappings, bilinear transformations. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Complex Integration and Conformal Mapping
|
|||||||||||||||||||||||||||||
Definite integrals of functions, contour integrals and its examples, Cauchy’s integral theorem, Cauchy integral formula, Liouville’s theorem and the fundamental theorem of algebra, elementary transformations, conformal mappings, bilinear transformations. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Power Series and Singularities
|
|||||||||||||||||||||||||||||
Convergence of sequences and series, Taylor series and its examples, Laurent series and its examples, absolute and uniform convergence of power series, zeros and poles. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Power Series and Singularities
|
|||||||||||||||||||||||||||||
Convergence of sequences and series, Taylor series and its examples, Laurent series and its examples, absolute and uniform convergence of power series, zeros and poles. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Power Series and Singularities
|
|||||||||||||||||||||||||||||
Convergence of sequences and series, Taylor series and its examples, Laurent series and its examples, absolute and uniform convergence of power series, zeros and poles. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Power Series and Singularities
|
|||||||||||||||||||||||||||||
Convergence of sequences and series, Taylor series and its examples, Laurent series and its examples, absolute and uniform convergence of power series, zeros and poles. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Power Series and Singularities
|
|||||||||||||||||||||||||||||
Convergence of sequences and series, Taylor series and its examples, Laurent series and its examples, absolute and uniform convergence of power series, zeros and poles. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Power Series and Singularities
|
|||||||||||||||||||||||||||||
Convergence of sequences and series, Taylor series and its examples, Laurent series and its examples, absolute and uniform convergence of power series, zeros and poles. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Power Series and Singularities
|
|||||||||||||||||||||||||||||
Convergence of sequences and series, Taylor series and its examples, Laurent series and its examples, absolute and uniform convergence of power series, zeros and poles. | |||||||||||||||||||||||||||||
Text Books And Reference Books: Dennis G. Zill and Patrick D. Shanahan, A first course in Complex Analysis with Applications, 2nd Ed, Jones & Barlett Publishers, 2011. | |||||||||||||||||||||||||||||
Essential Reading / Recommended Reading
| |||||||||||||||||||||||||||||
Evaluation Pattern
| |||||||||||||||||||||||||||||
MAT641A - MECHANICS (2022 Batch) | |||||||||||||||||||||||||||||
Total Teaching Hours for Semester:45 |
No of Lecture Hours/Week:3 |
||||||||||||||||||||||||||||
Max Marks:100 |
Credits:3 |
||||||||||||||||||||||||||||
Course Objectives/Course Description |
|||||||||||||||||||||||||||||
Course description: This course aims at introducing the basic concepts in statistics as well as dynamics of particles and rigid bodies; develop problem solving skills in mechanics through various applications. Course objectives: This course will help the learner to COBJ1. Gain familiarity with the concepts of force, triangular and parallelogram laws and conditions of equilibrium of forces. COBJ2. Analyse and interpret the Lamis Lemma and the resultant of more than one force. COBJ3. examine dynamical aspect of particles and rigid bodies. COBJ4. illustrate the concepts of simple harmonic motion and projectiles
|
|||||||||||||||||||||||||||||
Learning Outcome |
|||||||||||||||||||||||||||||
CO1: On successful completion of the course, the students should be able to compute resultant and direction of forces and examine the equilibrium of a force. CO2: On successful completion of the course, the students should be able to apply Lamis's Theorem and Varignon's Theorem in solving problems. CO3: On successful completion of the course, the students should be able to analyse the motion of a particle on a smooth surface. CO4: On successful completion of the course, the students should be able to discuss the motion of a particles subjected to Simple Harmonic Motion and fundamental concepts Projectiles. |
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Forces acting on particle / rigid body
|
|||||||||||||||||||||||||||||
Introduction and general principles, force vectors, moments, couple-equilibrium of a particle - coplanar forces acting on a rigid body, problems of equilibrium under forces | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Forces acting on particle / rigid body
|
|||||||||||||||||||||||||||||
Introduction and general principles, force vectors, moments, couple-equilibrium of a particle - coplanar forces acting on a rigid body, problems of equilibrium under forces | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Forces acting on particle / rigid body
|
|||||||||||||||||||||||||||||
Introduction and general principles, force vectors, moments, couple-equilibrium of a particle - coplanar forces acting on a rigid body, problems of equilibrium under forces | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Forces acting on particle / rigid body
|
|||||||||||||||||||||||||||||
Introduction and general principles, force vectors, moments, couple-equilibrium of a particle - coplanar forces acting on a rigid body, problems of equilibrium under forces | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Forces acting on particle / rigid body
|
|||||||||||||||||||||||||||||
Introduction and general principles, force vectors, moments, couple-equilibrium of a particle - coplanar forces acting on a rigid body, problems of equilibrium under forces | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:20 |
||||||||||||||||||||||||||||
Dynamics of a particle in 2D
|
|||||||||||||||||||||||||||||
Velocities and accelerations along radial and transverse directions and along tangential and normal directions; relation between angular and linear vectors, dynamics on smooth and rough plane curves. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:20 |
||||||||||||||||||||||||||||
Dynamics of a particle in 2D
|
|||||||||||||||||||||||||||||
Velocities and accelerations along radial and transverse directions and along tangential and normal directions; relation between angular and linear vectors, dynamics on smooth and rough plane curves. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:20 |
||||||||||||||||||||||||||||
Dynamics of a particle in 2D
|
|||||||||||||||||||||||||||||
Velocities and accelerations along radial and transverse directions and along tangential and normal directions; relation between angular and linear vectors, dynamics on smooth and rough plane curves. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:20 |
||||||||||||||||||||||||||||
Dynamics of a particle in 2D
|
|||||||||||||||||||||||||||||
Velocities and accelerations along radial and transverse directions and along tangential and normal directions; relation between angular and linear vectors, dynamics on smooth and rough plane curves. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:20 |
||||||||||||||||||||||||||||
Dynamics of a particle in 2D
|
|||||||||||||||||||||||||||||
Velocities and accelerations along radial and transverse directions and along tangential and normal directions; relation between angular and linear vectors, dynamics on smooth and rough plane curves. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:10 |
||||||||||||||||||||||||||||
Kinetics of particle and Projectile Motion
|
|||||||||||||||||||||||||||||
Simple harmonic motion, Newton’s laws of motion, projectiles. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:10 |
||||||||||||||||||||||||||||
Kinetics of particle and Projectile Motion
|
|||||||||||||||||||||||||||||
Simple harmonic motion, Newton’s laws of motion, projectiles. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:10 |
||||||||||||||||||||||||||||
Kinetics of particle and Projectile Motion
|
|||||||||||||||||||||||||||||
Simple harmonic motion, Newton’s laws of motion, projectiles. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:10 |
||||||||||||||||||||||||||||
Kinetics of particle and Projectile Motion
|
|||||||||||||||||||||||||||||
Simple harmonic motion, Newton’s laws of motion, projectiles. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:10 |
||||||||||||||||||||||||||||
Kinetics of particle and Projectile Motion
|
|||||||||||||||||||||||||||||
Simple harmonic motion, Newton’s laws of motion, projectiles. | |||||||||||||||||||||||||||||
Text Books And Reference Books:
| |||||||||||||||||||||||||||||
Essential Reading / Recommended Reading
| |||||||||||||||||||||||||||||
Evaluation Pattern
| |||||||||||||||||||||||||||||
MAT641B - NUMERICAL METHODS (2022 Batch) | |||||||||||||||||||||||||||||
Total Teaching Hours for Semester:45 |
No of Lecture Hours/Week:3 |
||||||||||||||||||||||||||||
Max Marks:100 |
Credits:3 |
||||||||||||||||||||||||||||
Course Objectives/Course Description |
|||||||||||||||||||||||||||||
Course description: To explore the complex world problems physicists, engineers, financiers and mathematicians require certain methods. These practical problems can rarely be solved analytically. Their solutions can only be approximated through numerical methods. This course deals with the theory and application of numerical approximation techniques.
Course objectives: This course will help the learner COBJ1. To learn about error analysis, solution of nonlinear equations, finite differences, interpolation, numerical integration and differentiation, numerical solution of differential equations, and matrix computation. COBJ2. It also emphasis the development of numerical algorithms to provide solutions to common problems formulated in science and engineering. |
|||||||||||||||||||||||||||||
Learning Outcome |
|||||||||||||||||||||||||||||
CO1.: On successful completion of the course, the students should be able to understand floating point numbers and the role of errors and its analysis in numerical methods. CO2.: On successful completion of the course, the students should be able to derive numerical methods for various mathematical operations and tasks, such as interpolation, differentiation, integration, the solution of linear and nonlinear equations, and the solution of differential equations. CO3.: On successful completion of the course, the students should be able to apply numerical methods to obtain approximate solutions to mathematical problems. CO4.: On successful completion of the course, the students should be able to understand the accuracy, consistency, stability and convergence of numerical methods |
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Error analysis, Nonlinear equations, and Solution of a system of linear Equations
|
|||||||||||||||||||||||||||||
Errors and their analysis, Floating point representation of numbers, solution of algebraic and Transcendental Equations: Bisection method, fixed point Iteration method, the method of False Position, Newton Raphson method and Mullers method. Solution of linear systems, matrix inversion method, Gauss elimination method, Gauss-Seidel and Gauss-Jacobi iterative methods, modification of the Gauss method to compute the inverse, LU decomposition method. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Error analysis, Nonlinear equations, and Solution of a system of linear Equations
|
|||||||||||||||||||||||||||||
Errors and their analysis, Floating point representation of numbers, solution of algebraic and Transcendental Equations: Bisection method, fixed point Iteration method, the method of False Position, Newton Raphson method and Mullers method. Solution of linear systems, matrix inversion method, Gauss elimination method, Gauss-Seidel and Gauss-Jacobi iterative methods, modification of the Gauss method to compute the inverse, LU decomposition method. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Error analysis, Nonlinear equations, and Solution of a system of linear Equations
|
|||||||||||||||||||||||||||||
Errors and their analysis, Floating point representation of numbers, solution of algebraic and Transcendental Equations: Bisection method, fixed point Iteration method, the method of False Position, Newton Raphson method and Mullers method. Solution of linear systems, matrix inversion method, Gauss elimination method, Gauss-Seidel and Gauss-Jacobi iterative methods, modification of the Gauss method to compute the inverse, LU decomposition method. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Error analysis, Nonlinear equations, and Solution of a system of linear Equations
|
|||||||||||||||||||||||||||||
Errors and their analysis, Floating point representation of numbers, solution of algebraic and Transcendental Equations: Bisection method, fixed point Iteration method, the method of False Position, Newton Raphson method and Mullers method. Solution of linear systems, matrix inversion method, Gauss elimination method, Gauss-Seidel and Gauss-Jacobi iterative methods, modification of the Gauss method to compute the inverse, LU decomposition method. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Error analysis, Nonlinear equations, and Solution of a system of linear Equations
|
|||||||||||||||||||||||||||||
Errors and their analysis, Floating point representation of numbers, solution of algebraic and Transcendental Equations: Bisection method, fixed point Iteration method, the method of False Position, Newton Raphson method and Mullers method. Solution of linear systems, matrix inversion method, Gauss elimination method, Gauss-Seidel and Gauss-Jacobi iterative methods, modification of the Gauss method to compute the inverse, LU decomposition method. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Finite Differences, Interpolation, and Numerical differentiation and Integration
|
|||||||||||||||||||||||||||||
Finite differences: Forward difference, backward difference and shift operators, separation of symbols, Newton’s formulae for interpolation, Lagrange’s interpolation formulae, numerical differentiation. Numerical integration: Trapezoidal rule, Simpson’s one-third rule and Simpson’s three-eighth rule. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Finite Differences, Interpolation, and Numerical differentiation and Integration
|
|||||||||||||||||||||||||||||
Finite differences: Forward difference, backward difference and shift operators, separation of symbols, Newton’s formulae for interpolation, Lagrange’s interpolation formulae, numerical differentiation. Numerical integration: Trapezoidal rule, Simpson’s one-third rule and Simpson’s three-eighth rule. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Finite Differences, Interpolation, and Numerical differentiation and Integration
|
|||||||||||||||||||||||||||||
Finite differences: Forward difference, backward difference and shift operators, separation of symbols, Newton’s formulae for interpolation, Lagrange’s interpolation formulae, numerical differentiation. Numerical integration: Trapezoidal rule, Simpson’s one-third rule and Simpson’s three-eighth rule. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Finite Differences, Interpolation, and Numerical differentiation and Integration
|
|||||||||||||||||||||||||||||
Finite differences: Forward difference, backward difference and shift operators, separation of symbols, Newton’s formulae for interpolation, Lagrange’s interpolation formulae, numerical differentiation. Numerical integration: Trapezoidal rule, Simpson’s one-third rule and Simpson’s three-eighth rule. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Finite Differences, Interpolation, and Numerical differentiation and Integration
|
|||||||||||||||||||||||||||||
Finite differences: Forward difference, backward difference and shift operators, separation of symbols, Newton’s formulae for interpolation, Lagrange’s interpolation formulae, numerical differentiation. Numerical integration: Trapezoidal rule, Simpson’s one-third rule and Simpson’s three-eighth rule. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Numerical Solution of Ordinary Differential Equations
|
|||||||||||||||||||||||||||||
Numerical solution of ordinary differential equations, Taylor’s series, Picard’s method, Euler’s method, modified Euler’s method, Runge Kutta methods, second order (with proof) and fourth order (without proof). | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Numerical Solution of Ordinary Differential Equations
|
|||||||||||||||||||||||||||||
Numerical solution of ordinary differential equations, Taylor’s series, Picard’s method, Euler’s method, modified Euler’s method, Runge Kutta methods, second order (with proof) and fourth order (without proof). | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Numerical Solution of Ordinary Differential Equations
|
|||||||||||||||||||||||||||||
Numerical solution of ordinary differential equations, Taylor’s series, Picard’s method, Euler’s method, modified Euler’s method, Runge Kutta methods, second order (with proof) and fourth order (without proof). | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Numerical Solution of Ordinary Differential Equations
|
|||||||||||||||||||||||||||||
Numerical solution of ordinary differential equations, Taylor’s series, Picard’s method, Euler’s method, modified Euler’s method, Runge Kutta methods, second order (with proof) and fourth order (without proof). | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Numerical Solution of Ordinary Differential Equations
|
|||||||||||||||||||||||||||||
Numerical solution of ordinary differential equations, Taylor’s series, Picard’s method, Euler’s method, modified Euler’s method, Runge Kutta methods, second order (with proof) and fourth order (without proof). | |||||||||||||||||||||||||||||
Text Books And Reference Books:
| |||||||||||||||||||||||||||||
Essential Reading / Recommended Reading
| |||||||||||||||||||||||||||||
Evaluation Pattern
| |||||||||||||||||||||||||||||
MAT641C - DISCRETE MATHEMATICS (2022 Batch) | |||||||||||||||||||||||||||||
Total Teaching Hours for Semester:45 |
No of Lecture Hours/Week:3 |
||||||||||||||||||||||||||||
Max Marks:100 |
Credits:3 |
||||||||||||||||||||||||||||
Course Objectives/Course Description |
|||||||||||||||||||||||||||||
Course description: It is a fundamental course in combinatorics involving set theory, permutations and combinations, generating functions, recurrence relations and lattices. Course objectives: This course will help the learner to COBJ1. gain a familiarity with fundamental concepts of combinatorial mathematics. COBJ2. understand the methods and problem solving techniques of discrete mathematics COBJ3. apply knowledge to analyze and solve problems using models of discrete mathematics |
|||||||||||||||||||||||||||||
Learning Outcome |
|||||||||||||||||||||||||||||
CO 1: On successful completion of the course, the students should be able to enhance research, inquiry, and analytical thinking abilities. CO 2: On successful completion of the course, the students should be able to apply the basics of combinatorics in analyzing problems. CO 3: On successful completion of the course, the students should be able to enhance problem-solving skills. |
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Combinatorics
|
|||||||||||||||||||||||||||||
Permutations and combinations, laws of set theory, Venn diagrams, relations and functions, Stirling numbers of the second kind, Pigeon hole principle. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Combinatorics
|
|||||||||||||||||||||||||||||
Permutations and combinations, laws of set theory, Venn diagrams, relations and functions, Stirling numbers of the second kind, Pigeon hole principle. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Combinatorics
|
|||||||||||||||||||||||||||||
Permutations and combinations, laws of set theory, Venn diagrams, relations and functions, Stirling numbers of the second kind, Pigeon hole principle. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Combinatorics
|
|||||||||||||||||||||||||||||
Permutations and combinations, laws of set theory, Venn diagrams, relations and functions, Stirling numbers of the second kind, Pigeon hole principle. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Combinatorics
|
|||||||||||||||||||||||||||||
Permutations and combinations, laws of set theory, Venn diagrams, relations and functions, Stirling numbers of the second kind, Pigeon hole principle. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Combinatorics
|
|||||||||||||||||||||||||||||
Permutations and combinations, laws of set theory, Venn diagrams, relations and functions, Stirling numbers of the second kind, Pigeon hole principle. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Combinatorics
|
|||||||||||||||||||||||||||||
Permutations and combinations, laws of set theory, Venn diagrams, relations and functions, Stirling numbers of the second kind, Pigeon hole principle. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Enumeration
|
|||||||||||||||||||||||||||||
Principle of inclusion and exclusion, generating functions, partitions of integers and recurrence relations. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Enumeration
|
|||||||||||||||||||||||||||||
Principle of inclusion and exclusion, generating functions, partitions of integers and recurrence relations. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Enumeration
|
|||||||||||||||||||||||||||||
Principle of inclusion and exclusion, generating functions, partitions of integers and recurrence relations. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Enumeration
|
|||||||||||||||||||||||||||||
Principle of inclusion and exclusion, generating functions, partitions of integers and recurrence relations. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Enumeration
|
|||||||||||||||||||||||||||||
Principle of inclusion and exclusion, generating functions, partitions of integers and recurrence relations. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Enumeration
|
|||||||||||||||||||||||||||||
Principle of inclusion and exclusion, generating functions, partitions of integers and recurrence relations. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Enumeration
|
|||||||||||||||||||||||||||||
Principle of inclusion and exclusion, generating functions, partitions of integers and recurrence relations. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Lattice Theory
|
|||||||||||||||||||||||||||||
Partially ordered set, lattices and their properties, duality principle, lattice homomorphisms, product lattices, modular and distributive lattices, Boolean lattices. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Lattice Theory
|
|||||||||||||||||||||||||||||
Partially ordered set, lattices and their properties, duality principle, lattice homomorphisms, product lattices, modular and distributive lattices, Boolean lattices. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Lattice Theory
|
|||||||||||||||||||||||||||||
Partially ordered set, lattices and their properties, duality principle, lattice homomorphisms, product lattices, modular and distributive lattices, Boolean lattices. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Lattice Theory
|
|||||||||||||||||||||||||||||
Partially ordered set, lattices and their properties, duality principle, lattice homomorphisms, product lattices, modular and distributive lattices, Boolean lattices. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Lattice Theory
|
|||||||||||||||||||||||||||||
Partially ordered set, lattices and their properties, duality principle, lattice homomorphisms, product lattices, modular and distributive lattices, Boolean lattices. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Lattice Theory
|
|||||||||||||||||||||||||||||
Partially ordered set, lattices and their properties, duality principle, lattice homomorphisms, product lattices, modular and distributive lattices, Boolean lattices. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Lattice Theory
|
|||||||||||||||||||||||||||||
Partially ordered set, lattices and their properties, duality principle, lattice homomorphisms, product lattices, modular and distributive lattices, Boolean lattices. | |||||||||||||||||||||||||||||
Text Books And Reference Books:
| |||||||||||||||||||||||||||||
Essential Reading / Recommended Reading
| |||||||||||||||||||||||||||||
Evaluation Pattern
| |||||||||||||||||||||||||||||
MAT641D - NUMBER THEORY (2022 Batch) | |||||||||||||||||||||||||||||
Total Teaching Hours for Semester:45 |
No of Lecture Hours/Week:3 |
||||||||||||||||||||||||||||
Max Marks:100 |
Credits:3 |
||||||||||||||||||||||||||||
Course Objectives/Course Description |
|||||||||||||||||||||||||||||
Course Description: This course is an introduction to elementary topics of analytical number theory. Topics such as divisibility, congruences and number-theoretic functions are discussed in this course. Some of the applications of these concepts are also included. Course Objectives: This course will help the learner to COBJ1. engage in sound mathematical thinking and reasoning. COBJ2. analyze, evaluate, or solve problems for given data or information. COBJ3. understand and utilize mathematical functions and empirical principles and processes. COBJ4. develop critical thinking skills, communication skills, and empirical and quantitative skills. |
|||||||||||||||||||||||||||||
Learning Outcome |
|||||||||||||||||||||||||||||
CO1: After the completion of this course, learners are expected to effectively express the concepts and results of number theory. CO2: After the completion of this course, learners are expected to understand the logic and methods behind the proofs in number theory. CO3: After the completion of this course, learners are expected to solve challenging problems in number theory. CO4: After the completion of this course, learners are expected to present specific topics and prove various ideas with mathematical rigour. |
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Divisibility
|
|||||||||||||||||||||||||||||
The division algorithm, the greatest common divisor, the Euclidean algorithm, the linear Diophantine equation, the fundamental theorem of arithmetic, distribution of primes. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Divisibility
|
|||||||||||||||||||||||||||||
The division algorithm, the greatest common divisor, the Euclidean algorithm, the linear Diophantine equation, the fundamental theorem of arithmetic, distribution of primes. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Divisibility
|
|||||||||||||||||||||||||||||
The division algorithm, the greatest common divisor, the Euclidean algorithm, the linear Diophantine equation, the fundamental theorem of arithmetic, distribution of primes. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Divisibility
|
|||||||||||||||||||||||||||||
The division algorithm, the greatest common divisor, the Euclidean algorithm, the linear Diophantine equation, the fundamental theorem of arithmetic, distribution of primes. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Divisibility
|
|||||||||||||||||||||||||||||
The division algorithm, the greatest common divisor, the Euclidean algorithm, the linear Diophantine equation, the fundamental theorem of arithmetic, distribution of primes. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Divisibility
|
|||||||||||||||||||||||||||||
The division algorithm, the greatest common divisor, the Euclidean algorithm, the linear Diophantine equation, the fundamental theorem of arithmetic, distribution of primes. | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Divisibility
|
|||||||||||||||||||||||||||||
The division algorithm, the greatest common divisor, the Euclidean algorithm, the linear Diophantine equation, the fundamental theorem of arithmetic, distribution of primes. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Linear Congruence
|
|||||||||||||||||||||||||||||
Basic properties of congruences, systems of residues, number conversions, linear congruences and Chinese remainder theorem, a system of linear congruences in two variables, Fermat’s Little Theorem and pseudoprimes, Wilson’s Theorem. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Linear Congruence
|
|||||||||||||||||||||||||||||
Basic properties of congruences, systems of residues, number conversions, linear congruences and Chinese remainder theorem, a system of linear congruences in two variables, Fermat’s Little Theorem and pseudoprimes, Wilson’s Theorem. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Linear Congruence
|
|||||||||||||||||||||||||||||
Basic properties of congruences, systems of residues, number conversions, linear congruences and Chinese remainder theorem, a system of linear congruences in two variables, Fermat’s Little Theorem and pseudoprimes, Wilson’s Theorem. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Linear Congruence
|
|||||||||||||||||||||||||||||
Basic properties of congruences, systems of residues, number conversions, linear congruences and Chinese remainder theorem, a system of linear congruences in two variables, Fermat’s Little Theorem and pseudoprimes, Wilson’s Theorem. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Linear Congruence
|
|||||||||||||||||||||||||||||
Basic properties of congruences, systems of residues, number conversions, linear congruences and Chinese remainder theorem, a system of linear congruences in two variables, Fermat’s Little Theorem and pseudoprimes, Wilson’s Theorem. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Linear Congruence
|
|||||||||||||||||||||||||||||
Basic properties of congruences, systems of residues, number conversions, linear congruences and Chinese remainder theorem, a system of linear congruences in two variables, Fermat’s Little Theorem and pseudoprimes, Wilson’s Theorem. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Linear Congruence
|
|||||||||||||||||||||||||||||
Basic properties of congruences, systems of residues, number conversions, linear congruences and Chinese remainder theorem, a system of linear congruences in two variables, Fermat’s Little Theorem and pseudoprimes, Wilson’s Theorem. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Number Theoretic Functions
|
|||||||||||||||||||||||||||||
The Greatest Integer Function, Euler’s Phi-Function, Euler’s theorem, Some Properties of Phi-function. Applications of Number Theory: Hashing functions, pseudorandom Numbers, check bits, cryptography.
| |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Number Theoretic Functions
|
|||||||||||||||||||||||||||||
The Greatest Integer Function, Euler’s Phi-Function, Euler’s theorem, Some Properties of Phi-function. Applications of Number Theory: Hashing functions, pseudorandom Numbers, check bits, cryptography.
| |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Number Theoretic Functions
|
|||||||||||||||||||||||||||||
The Greatest Integer Function, Euler’s Phi-Function, Euler’s theorem, Some Properties of Phi-function. Applications of Number Theory: Hashing functions, pseudorandom Numbers, check bits, cryptography.
| |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Number Theoretic Functions
|
|||||||||||||||||||||||||||||
The Greatest Integer Function, Euler’s Phi-Function, Euler’s theorem, Some Properties of Phi-function. Applications of Number Theory: Hashing functions, pseudorandom Numbers, check bits, cryptography.
| |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Number Theoretic Functions
|
|||||||||||||||||||||||||||||
The Greatest Integer Function, Euler’s Phi-Function, Euler’s theorem, Some Properties of Phi-function. Applications of Number Theory: Hashing functions, pseudorandom Numbers, check bits, cryptography.
| |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Number Theoretic Functions
|
|||||||||||||||||||||||||||||
The Greatest Integer Function, Euler’s Phi-Function, Euler’s theorem, Some Properties of Phi-function. Applications of Number Theory: Hashing functions, pseudorandom Numbers, check bits, cryptography.
| |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Number Theoretic Functions
|
|||||||||||||||||||||||||||||
The Greatest Integer Function, Euler’s Phi-Function, Euler’s theorem, Some Properties of Phi-function. Applications of Number Theory: Hashing functions, pseudorandom Numbers, check bits, cryptography.
| |||||||||||||||||||||||||||||
Text Books And Reference Books:
| |||||||||||||||||||||||||||||
Essential Reading / Recommended Reading
| |||||||||||||||||||||||||||||
Evaluation Pattern
| |||||||||||||||||||||||||||||
MAT641E - FINANCIAL MATHEMATICS (2022 Batch) | |||||||||||||||||||||||||||||
Total Teaching Hours for Semester:45 |
No of Lecture Hours/Week:3 |
||||||||||||||||||||||||||||
Max Marks:100 |
Credits:3 |
||||||||||||||||||||||||||||
Course Objectives/Course Description |
|||||||||||||||||||||||||||||
Course Description:Financial Mathematics deals with the solving of financial problems by using Mathematical methods. This course aims at introducing the basic ideas of deterministic mathematics of finance. The course focuses on imparting sound knowledge on elementary notions like simple interest, complex interest (annual and non-annual), annuities (varying and non-varying), loans and bonds. Course objectives: This course will help the learner to COBJ 1: gain familiarity in solving problems on Interest rates and Level Annuitiesd COBJ 2: derive formulae for different types of varying annuities and solve its associated problems COBJ 3: gain in depth knowledge on Loans and Bonds and hence create schedules for Loan Repayment and Bond Amortization Schedules. |
|||||||||||||||||||||||||||||
Learning Outcome |
|||||||||||||||||||||||||||||
CO1: On successful completion of the course, the students should be able to deal with the elementary notions like simple interest, compound interest and Annuities. CO2: On successful completion of the course, the students should be able to solve simple problems on interest rates, annuities, varying annuities, non-annual interest rates, loans and bonds. CO3: On successful completion of the course, the students should be able to apply the formulae appropriately in solving problems that mimics real life scenario. |
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Interest Rates, Factors and Level Annuities
|
|||||||||||||||||||||||||||||
Interest Rates, Rate of discount, Nominal rates of interest and discount, Constant force of interest, Force of interest, Inflation, Equations of Value and Yield Rates, Annuity-Immediate, Annuity-Due, Perpetuities, Deferred Annuities and values on any date, Outstanding Loan Balances (OLB) | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Interest Rates, Factors and Level Annuities
|
|||||||||||||||||||||||||||||
Interest Rates, Rate of discount, Nominal rates of interest and discount, Constant force of interest, Force of interest, Inflation, Equations of Value and Yield Rates, Annuity-Immediate, Annuity-Due, Perpetuities, Deferred Annuities and values on any date, Outstanding Loan Balances (OLB) | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Interest Rates, Factors and Level Annuities
|
|||||||||||||||||||||||||||||
Interest Rates, Rate of discount, Nominal rates of interest and discount, Constant force of interest, Force of interest, Inflation, Equations of Value and Yield Rates, Annuity-Immediate, Annuity-Due, Perpetuities, Deferred Annuities and values on any date, Outstanding Loan Balances (OLB) | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Interest Rates, Factors and Level Annuities
|
|||||||||||||||||||||||||||||
Interest Rates, Rate of discount, Nominal rates of interest and discount, Constant force of interest, Force of interest, Inflation, Equations of Value and Yield Rates, Annuity-Immediate, Annuity-Due, Perpetuities, Deferred Annuities and values on any date, Outstanding Loan Balances (OLB) | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Interest Rates, Factors and Level Annuities
|
|||||||||||||||||||||||||||||
Interest Rates, Rate of discount, Nominal rates of interest and discount, Constant force of interest, Force of interest, Inflation, Equations of Value and Yield Rates, Annuity-Immediate, Annuity-Due, Perpetuities, Deferred Annuities and values on any date, Outstanding Loan Balances (OLB) | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Interest Rates, Factors and Level Annuities
|
|||||||||||||||||||||||||||||
Interest Rates, Rate of discount, Nominal rates of interest and discount, Constant force of interest, Force of interest, Inflation, Equations of Value and Yield Rates, Annuity-Immediate, Annuity-Due, Perpetuities, Deferred Annuities and values on any date, Outstanding Loan Balances (OLB) | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Interest Rates, Factors and Level Annuities
|
|||||||||||||||||||||||||||||
Interest Rates, Rate of discount, Nominal rates of interest and discount, Constant force of interest, Force of interest, Inflation, Equations of Value and Yield Rates, Annuity-Immediate, Annuity-Due, Perpetuities, Deferred Annuities and values on any date, Outstanding Loan Balances (OLB) | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Interest Rates, Factors and Level Annuities
|
|||||||||||||||||||||||||||||
Interest Rates, Rate of discount, Nominal rates of interest and discount, Constant force of interest, Force of interest, Inflation, Equations of Value and Yield Rates, Annuity-Immediate, Annuity-Due, Perpetuities, Deferred Annuities and values on any date, Outstanding Loan Balances (OLB) | |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Interest Rates, Factors and Level Annuities
|
|||||||||||||||||||||||||||||
Interest Rates, Rate of discount, Nominal rates of interest and discount, Constant force of interest, Force of interest, Inflation, Equations of Value and Yield Rates, Annuity-Immediate, Annuity-Due, Perpetuities, Deferred Annuities and values on any date, Outstanding Loan Balances (OLB) | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Varying Annuities
|
|||||||||||||||||||||||||||||
Non-level Annuities, Annuities with payments in Geometric Progression, Annuities with payment in Arithmetic Progression, Annuity symbols for non-integral terms, Annuities with payments less/more frequent than each interest period and payments in Arithmetic Progression, Continuously Payable Annuities. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Varying Annuities
|
|||||||||||||||||||||||||||||
Non-level Annuities, Annuities with payments in Geometric Progression, Annuities with payment in Arithmetic Progression, Annuity symbols for non-integral terms, Annuities with payments less/more frequent than each interest period and payments in Arithmetic Progression, Continuously Payable Annuities. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Varying Annuities
|
|||||||||||||||||||||||||||||
Non-level Annuities, Annuities with payments in Geometric Progression, Annuities with payment in Arithmetic Progression, Annuity symbols for non-integral terms, Annuities with payments less/more frequent than each interest period and payments in Arithmetic Progression, Continuously Payable Annuities. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Varying Annuities
|
|||||||||||||||||||||||||||||
Non-level Annuities, Annuities with payments in Geometric Progression, Annuities with payment in Arithmetic Progression, Annuity symbols for non-integral terms, Annuities with payments less/more frequent than each interest period and payments in Arithmetic Progression, Continuously Payable Annuities. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Varying Annuities
|
|||||||||||||||||||||||||||||
Non-level Annuities, Annuities with payments in Geometric Progression, Annuities with payment in Arithmetic Progression, Annuity symbols for non-integral terms, Annuities with payments less/more frequent than each interest period and payments in Arithmetic Progression, Continuously Payable Annuities. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Varying Annuities
|
|||||||||||||||||||||||||||||
Non-level Annuities, Annuities with payments in Geometric Progression, Annuities with payment in Arithmetic Progression, Annuity symbols for non-integral terms, Annuities with payments less/more frequent than each interest period and payments in Arithmetic Progression, Continuously Payable Annuities. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Varying Annuities
|
|||||||||||||||||||||||||||||
Non-level Annuities, Annuities with payments in Geometric Progression, Annuities with payment in Arithmetic Progression, Annuity symbols for non-integral terms, Annuities with payments less/more frequent than each interest period and payments in Arithmetic Progression, Continuously Payable Annuities. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Varying Annuities
|
|||||||||||||||||||||||||||||
Non-level Annuities, Annuities with payments in Geometric Progression, Annuities with payment in Arithmetic Progression, Annuity symbols for non-integral terms, Annuities with payments less/more frequent than each interest period and payments in Arithmetic Progression, Continuously Payable Annuities. | |||||||||||||||||||||||||||||
Unit-2 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Varying Annuities
|
|||||||||||||||||||||||||||||
Non-level Annuities, Annuities with payments in Geometric Progression, Annuities with payment in Arithmetic Progression, Annuity symbols for non-integral terms, Annuities with payments less/more frequent than each interest period and payments in Arithmetic Progression, Continuously Payable Annuities. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Loans Repayment and Bonds
|
|||||||||||||||||||||||||||||
Amortized loans and Amortization Schedules, The sinking fund method, Loans with other repayment patterns, Yield rate examples and other repayment patterns, Bond symbols and basic price formula, Other pricing formula for bonds, Bond Amortization Schedules, Valuing a bond after its date of issue. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Loans Repayment and Bonds
|
|||||||||||||||||||||||||||||
Amortized loans and Amortization Schedules, The sinking fund method, Loans with other repayment patterns, Yield rate examples and other repayment patterns, Bond symbols and basic price formula, Other pricing formula for bonds, Bond Amortization Schedules, Valuing a bond after its date of issue. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Loans Repayment and Bonds
|
|||||||||||||||||||||||||||||
Amortized loans and Amortization Schedules, The sinking fund method, Loans with other repayment patterns, Yield rate examples and other repayment patterns, Bond symbols and basic price formula, Other pricing formula for bonds, Bond Amortization Schedules, Valuing a bond after its date of issue. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Loans Repayment and Bonds
|
|||||||||||||||||||||||||||||
Amortized loans and Amortization Schedules, The sinking fund method, Loans with other repayment patterns, Yield rate examples and other repayment patterns, Bond symbols and basic price formula, Other pricing formula for bonds, Bond Amortization Schedules, Valuing a bond after its date of issue. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Loans Repayment and Bonds
|
|||||||||||||||||||||||||||||
Amortized loans and Amortization Schedules, The sinking fund method, Loans with other repayment patterns, Yield rate examples and other repayment patterns, Bond symbols and basic price formula, Other pricing formula for bonds, Bond Amortization Schedules, Valuing a bond after its date of issue. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Loans Repayment and Bonds
|
|||||||||||||||||||||||||||||
Amortized loans and Amortization Schedules, The sinking fund method, Loans with other repayment patterns, Yield rate examples and other repayment patterns, Bond symbols and basic price formula, Other pricing formula for bonds, Bond Amortization Schedules, Valuing a bond after its date of issue. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Loans Repayment and Bonds
|
|||||||||||||||||||||||||||||
Amortized loans and Amortization Schedules, The sinking fund method, Loans with other repayment patterns, Yield rate examples and other repayment patterns, Bond symbols and basic price formula, Other pricing formula for bonds, Bond Amortization Schedules, Valuing a bond after its date of issue. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Loans Repayment and Bonds
|
|||||||||||||||||||||||||||||
Amortized loans and Amortization Schedules, The sinking fund method, Loans with other repayment patterns, Yield rate examples and other repayment patterns, Bond symbols and basic price formula, Other pricing formula for bonds, Bond Amortization Schedules, Valuing a bond after its date of issue. | |||||||||||||||||||||||||||||
Unit-3 |
Teaching Hours:15 |
||||||||||||||||||||||||||||
Loans Repayment and Bonds
|
|||||||||||||||||||||||||||||
Amortized loans and Amortization Schedules, The sinking fund method, Loans with other repayment patterns, Yield rate examples and other repayment patterns, Bond symbols and basic price formula, Other pricing formula for bonds, Bond Amortization Schedules, Valuing a bond after its date of issue. | |||||||||||||||||||||||||||||
Text Books And Reference Books: L. J. F. Vaaler and J. W. Daniel, Mathematical interest theory. Mathematical Association of America, 2009. | |||||||||||||||||||||||||||||
Essential Reading / Recommended Reading
| |||||||||||||||||||||||||||||
Evaluation Pattern
| |||||||||||||||||||||||||||||
MAT651 - COMPLEX ANALYSIS USING PYTHON (2022 Batch) | |||||||||||||||||||||||||||||
Total Teaching Hours for Semester:30 |
No of Lecture Hours/Week:2 |
||||||||||||||||||||||||||||
Max Marks:50 |
Credits:2 |
||||||||||||||||||||||||||||
Course Objectives/Course Description |
|||||||||||||||||||||||||||||
Course Description: This course will enable students to have hands on experience in constructing analytic functions, verifying harmonic functions, illustrating Cauchy’s integral theorem and bilinear transformations and in illustrating different types of sequences and series using Python. Course Objectives: This course will help the learner to COBJ 1:Python language using jupyter interface COBJ 2:Solving basic arithmetic problems using cmath built-in commands COBJ 3:Solving problems using cmath. |
|||||||||||||||||||||||||||||
Learning Outcome |
|||||||||||||||||||||||||||||
CO 1: On successful completion of the course, the students should be able to acquire proficiency in using Python and cmath functions for processing complex numbers. CO 2: On successful completion of the course, the students should be able to skillful in using Python modules to implement Milne-Thompson method. CO 3: On successful completion of the course, the students should be able to expertise in illustrating harmonic functions and demonstrating Cauchy's integral theorem Representation of conformal mappings using Matplotlib. |
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics:
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics:
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics:
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics:
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics:
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics:
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics:
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Text Books And Reference Books: H P Langtangen, A Primer on Scientific Programming with Python, 2nd ed., Springer, 2016. | |||||||||||||||||||||||||||||
Essential Reading / Recommended Reading
| |||||||||||||||||||||||||||||
Evaluation Pattern The course is evaluated based on continuous internal assessments (CIA) and the lab e-record. The parameters for evaluation under each component and the mode of assessment are given below.
| |||||||||||||||||||||||||||||
MAT651A - MECHANICS USING PYTHON (2022 Batch) | |||||||||||||||||||||||||||||
Total Teaching Hours for Semester:30 |
No of Lecture Hours/Week:2 |
||||||||||||||||||||||||||||
Max Marks:50 |
Credits:2 |
||||||||||||||||||||||||||||
Course Objectives/Course Description |
|||||||||||||||||||||||||||||
Course Description: This course aims at enabling the students to explore and study the statics and dynamics of particles in a detailed manner using Python. This course is designed with a learner-centric approach wherein the students will acquire mastery in understanding mechanics using Python. Course objectives: This course will help the learner to COBJ 1: acquire skill in usage of suitable functions/packages of Python. COBJ 2: gain proficiency in using Python to solve problems on Mechanics. |
|||||||||||||||||||||||||||||
Learning Outcome |
|||||||||||||||||||||||||||||
CO1: On successful completion of the course, the students should be able to acquire proficiency in using different functions of Python to study Differential Calculus. Mechanics. CO2: On successful completion of the course, the students should be able to demonstrate the use of Python to understand and interpret the dynamical aspects of Python. CO3: On successful completion of the course, the students should be able to use Python to evaluate the resultant of forces and check for equilibrium state of the forces. CO4: On successful completion of the course, the students should be able to be familiar with the built-in functions to find moment and couple. |
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Text Books And Reference Books:
| |||||||||||||||||||||||||||||
Essential Reading / Recommended Reading A. Saha, Doing Math with Python: Use Programming to Explore Algebra, Statistics, Calculus, and More!, no starch press: San Fransisco, 2015. | |||||||||||||||||||||||||||||
Evaluation Pattern The course is evaluated based on continuous internal assessments (CIA) and the lab e-record. The parameters for evaluation under each component and the mode of assessment are given below.
| |||||||||||||||||||||||||||||
MAT651B - NUMERICAL METHODS USING PYTHON (2022 Batch) | |||||||||||||||||||||||||||||
Total Teaching Hours for Semester:30 |
No of Lecture Hours/Week:2 |
||||||||||||||||||||||||||||
Max Marks:50 |
Credits:2 |
||||||||||||||||||||||||||||
Course Objectives/Course Description |
|||||||||||||||||||||||||||||
Course Description: This course will help the students to have an in depth knowledge of various numerical methods required in scientific and technological applications. Students will gain hands on experience in using Python for illustrating various numerical techniques. Course Objectives: This course will help the learner to COBJ 1: develop the basic understanding of numerical algorithms and skills to implement algorithms to solve mathematical problems using Python. COBJ 2: develop the basic understanding of the applicability and limitations of the techniques. |
|||||||||||||||||||||||||||||
Learning Outcome |
|||||||||||||||||||||||||||||
CO1.: On successful completion of the course, the students should be able to implement a numerical solution method in a well-designed, well-documented Python program code. CO2.: On successful completion of the course, the students should be able to interpret the numerical solutions that were obtained in regard to their accuracy and suitability for applications CO3.: On successful completion of the course, the students should be able to present and interpret numerical results in an informative way. |
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed topics
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed topics
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed topics
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed topics
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed topics
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Text Books And Reference Books: J. Kiusalaas, Numerical methods in engineering with Python 3, Cambridge University press, 2013. | |||||||||||||||||||||||||||||
Essential Reading / Recommended Reading H. Fangohr, Introduction to Python for Computational Science and Engineering (A beginner’s guide), University of Southampton, 2015. | |||||||||||||||||||||||||||||
Evaluation Pattern The course is evaluated based on continuous internal assessments (CIA) and the lab e-record. The parameters for evaluation under each component and the mode of assessment are given below.
| |||||||||||||||||||||||||||||
MAT651C - DISCRETE MATHEMATICS USING PYTHON (2022 Batch) | |||||||||||||||||||||||||||||
Total Teaching Hours for Semester:30 |
No of Lecture Hours/Week:2 |
||||||||||||||||||||||||||||
Max Marks:50 |
Credits:2 |
||||||||||||||||||||||||||||
Course Objectives/Course Description |
|||||||||||||||||||||||||||||
Course description: This course aims at providing hands on experience in using Python functions to illustrate the notions of combinatorics, set theory and relations. Course objectives: This course will help the learner to COBJ1. gain a familiarity with programs on fundamental concepts of Combinatorial Mathematics COBJ2. understand and apply knowledge to solve combinatorial problems using Python |
|||||||||||||||||||||||||||||
Learning Outcome |
|||||||||||||||||||||||||||||
CO1: On successful completion of the course, the students should be able to attain sufficient skills in using Python functions CO2: On successful completion of the course, the students should be able to demonstrate programming skills in solving problems related to applications of computational mathematics. |
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Text Books And Reference Books:
| |||||||||||||||||||||||||||||
Essential Reading / Recommended Reading
| |||||||||||||||||||||||||||||
Evaluation Pattern The course is evaluated based on continuous internal assessments (CIA) and the lab e-record. The parameters for evaluation under each component and the mode of assessment are given below.
| |||||||||||||||||||||||||||||
MAT651D - NUMBER THEORY USING PYTHON (2022 Batch) | |||||||||||||||||||||||||||||
Total Teaching Hours for Semester:30 |
No of Lecture Hours/Week:2 |
||||||||||||||||||||||||||||
Max Marks:50 |
Credits:2 |
||||||||||||||||||||||||||||
Course Objectives/Course Description |
|||||||||||||||||||||||||||||
Course Description: This course will help the students to gain hands-on experience in using Python for illustrating various number theory concepts such as the divisibility, distribution of primes, number conversions, congruences and applications of number theory. Course Objectives: This course will help the learner to COBJ1. be familiar with the built- in functions required to deal with number theoretic concepts and operations. COBJ2. develop programming skills to solve various number theoretic concepts. COBJ3. gain proficiency in symbolic computation using python. |
|||||||||||||||||||||||||||||
Learning Outcome |
|||||||||||||||||||||||||||||
CO1: On successfully completing the course, the students should be able to use Python to solve problems in number theory, number conversions. CO2: On successfully completing the course, the students should be able to use Python to demonstrate the understanding of number theory concepts. CO3: On successfully completing the course, the students should be able to use Python to model and solve practical problems using number theoretic concepts. |
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics:
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics:
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics:
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics:
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics:
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics:
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics:
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Text Books And Reference Books: J.C. Bautista, Mathematics with Python Programming, Lulu.com, 2014. | |||||||||||||||||||||||||||||
Essential Reading / Recommended Reading M. Litvin and G. Litvin, Mathematics for the Digital Age and Programming in Python, Skylight Publishing, 2010. | |||||||||||||||||||||||||||||
Evaluation Pattern The course is evaluated based on continuous internal assessments (CIA) and the lab e-record. The parameters for evaluation under each component and the mode of assessment are given below.
| |||||||||||||||||||||||||||||
MAT651E - FINANCIAL MATHEMATICS USING EXCEL AND PYTHON (2022 Batch) | |||||||||||||||||||||||||||||
Total Teaching Hours for Semester:30 |
No of Lecture Hours/Week:2 |
||||||||||||||||||||||||||||
Max Marks:50 |
Credits:2 |
||||||||||||||||||||||||||||
Course Objectives/Course Description |
|||||||||||||||||||||||||||||
Course Description: The course aims at providing hands on experience in using Excel/Python programming to illustrate the computation of constant/varying force of interest, continuously payable varying/non-varying annuities, increasing/decreasing annuity immediate/due, loans and bonds. Course objectives: This course will help the learner to COBJ1. aacquire skill in solving problems on Financial Mathematics using Python. COBJ2. gain proficiency in using the Python programming skills to solve problems on Financial Mathematics. |
|||||||||||||||||||||||||||||
Learning Outcome |
|||||||||||||||||||||||||||||
CO1: On successful completion of the course, the students should be able to demonstrate sufficient skills in using Python programming language for solving problems on Financial Mathematics. CO2: On successful completion of the course, the students should be able to apply the notions on various types of interests, annuities, loans and bonds, by solving problems using Python. |
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Unit-1 |
Teaching Hours:30 |
||||||||||||||||||||||||||||
Proposed Topics
|
|||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||
Text Books And Reference Books:
| |||||||||||||||||||||||||||||
Essential Reading / Recommended Reading
| |||||||||||||||||||||||||||||
Evaluation Pattern The course is evaluated based on continuous internal assessments (CIA) and the lab e-record. The parameters for evaluation under each component and the mode of assessment are given below.
| |||||||||||||||||||||||||||||
MAT681 - PROJECT ON MATHEMATICAL MODELS (2022 Batch) | |||||||||||||||||||||||||||||
Total Teaching Hours for Semester:75 |
No of Lecture Hours/Week:5 |
||||||||||||||||||||||||||||
Max Marks:150 |
Credits:5 |
||||||||||||||||||||||||||||
Course Objectives/Course Description |
|||||||||||||||||||||||||||||
Course description: The course aims at providing hands on experience in analyzing practical problems by formulating the corresponding mathematical models. Course objectives: This course will help the learner to COBJ1. Develop positive attitude, knowledge and competence for research in Mathematics |
|||||||||||||||||||||||||||||
Learning Outcome |
|||||||||||||||||||||||||||||
CO1.: On successful completion of the course, the students should be able to demonstrate analytical skills. CO2.: On successful completion of the course, the students should be able to apply computational skills in Mathematics |
Unit-1 |
Teaching Hours:75 |
PROJECT
|
|
Students are given a choice of topics in Mathematical modelling at the undergraduate level with the approval of HOD. Each candidate will work under the supervision of the faculty. Project Coordinator will allot the supervisor for each candidate in consultation with the HOD at the end of the fifth semester. Project need not be based on original research work. Project could be based on the review of research papers that are at the undergraduate level. Each candidate has to submit a dissertation on the project topic followed by viva voce examination. The viva voce will be conducted by the committee constituted by the head of the department which will have an external and an internal examiner. The student must secure 50% of the marks to pass the examination. The candidates who fail must redo the project as per the university regulations. Proposed Topics for Project:
| |
Unit-1 |
Teaching Hours:75 |
PROJECT
|
|
Students are given a choice of topics in Mathematical modelling at the undergraduate level with the approval of HOD. Each candidate will work under the supervision of the faculty. Project Coordinator will allot the supervisor for each candidate in consultation with the HOD at the end of the fifth semester. Project need not be based on original research work. Project could be based on the review of research papers that are at the undergraduate level. Each candidate has to submit a dissertation on the project topic followed by viva voce examination. The viva voce will be conducted by the committee constituted by the head of the department which will have an external and an internal examiner. The student must secure 50% of the marks to pass the examination. The candidates who fail must redo the project as per the university regulations. Proposed Topics for Project:
| |
Unit-1 |
Teaching Hours:75 |
PROJECT
|
|
Students are given a choice of topics in Mathematical modelling at the undergraduate level with the approval of HOD. Each candidate will work under the supervision of the faculty. Project Coordinator will allot the supervisor for each candidate in consultation with the HOD at the end of the fifth semester. Project need not be based on original research work. Project could be based on the review of research papers that are at the undergraduate level. Each candidate has to submit a dissertation on the project topic followed by viva voce examination. The viva voce will be conducted by the committee constituted by the head of the department which will have an external and an internal examiner. The student must secure 50% of the marks to pass the examination. The candidates who fail must redo the project as per the university regulations. Proposed Topics for Project:
| |
Unit-1 |
Teaching Hours:75 |
PROJECT
|
|
Students are given a choice of topics in Mathematical modelling at the undergraduate level with the approval of HOD. Each candidate will work under the supervision of the faculty. Project Coordinator will allot the supervisor for each candidate in consultation with the HOD at the end of the fifth semester. Project need not be based on original research work. Project could be based on the review of research papers that are at the undergraduate level. Each candidate has to submit a dissertation on the project topic followed by viva voce examination. The viva voce will be conducted by the committee constituted by the head of the department which will have an external and an internal examiner. The student must secure 50% of the marks to pass the examination. The candidates who fail must redo the project as per the university regulations. Proposed Topics for Project:
| |
Unit-1 |
Teaching Hours:75 |
PROJECT
|
|
Students are given a choice of topics in Mathematical modelling at the undergraduate level with the approval of HOD. Each candidate will work under the supervision of the faculty. Project Coordinator will allot the supervisor for each candidate in consultation with the HOD at the end of the fifth semester. Project need not be based on original research work. Project could be based on the review of research papers that are at the undergraduate level. Each candidate has to submit a dissertation on the project topic followed by viva voce examination. The viva voce will be conducted by the committee constituted by the head of the department which will have an external and an internal examiner. The student must secure 50% of the marks to pass the examination. The candidates who fail must redo the project as per the university regulations. Proposed Topics for Project:
| |
Text Books And Reference Books: As per the field of reserach. | |
Essential Reading / Recommended Reading As per the field of reserach. | |
Evaluation Pattern
| |
STA631 - TIME SERIES ANALYSIS AND FORECASTING TECHNIQUES (2022 Batch) | |
Total Teaching Hours for Semester:45 |
No of Lecture Hours/Week:3 |
Max Marks:100 |
Credits:3 |
Course Objectives/Course Description |
|
This course covers applied statistical methods pertaining to time series and forecasting techniques. Moving average models like simple, weighted and exponential are dealt with. Stationary time series models and non-stationary time series models like AR, MA, ARMA and ARIMA are introduced to analyse time series data. |
|
Learning Outcome |
|
CO1: Demonstrate the approach and analyze univariate time series CO2: Infer the difference between various time series models like AR, MA, ARMA and ARIMA models CO3: Apply the various forecasting techniques to predict the future observations for real time data. |
Unit-1 |
Teaching Hours:15 |
Introduction to Time Series and Stochastic Process
|
|
Introduction to time series and stochastic process, graphical representation, components and classical decomposition of time series data.Auto-covariance and auto-correlation functions, Exploratory time series analysis, Test for trend and seasonality, Smoothing techniques such as Exponential and moving average smoothing, Holt- Winter smoothing, Forecasting based on smoothing. | |
Unit-1 |
Teaching Hours:15 |
Introduction to Time Series and Stochastic Process
|
|
Introduction to time series and stochastic process, graphical representation, components and classical decomposition of time series data.Auto-covariance and auto-correlation functions, Exploratory time series analysis, Test for trend and seasonality, Smoothing techniques such as Exponential and moving average smoothing, Holt- Winter smoothing, Forecasting based on smoothing. | |
Unit-1 |
Teaching Hours:15 |
Introduction to Time Series and Stochastic Process
|
|
Introduction to time series and stochastic process, graphical representation, components and classical decomposition of time series data.Auto-covariance and auto-correlation functions, Exploratory time series analysis, Test for trend and seasonality, Smoothing techniques such as Exponential and moving average smoothing, Holt- Winter smoothing, Forecasting based on smoothing. | |
Unit-1 |
Teaching Hours:15 |
Introduction to Time Series and Stochastic Process
|
|
Introduction to time series and stochastic process, graphical representation, components and classical decomposition of time series data.Auto-covariance and auto-correlation functions, Exploratory time series analysis, Test for trend and seasonality, Smoothing techniques such as Exponential and moving average smoothing, Holt- Winter smoothing, Forecasting based on smoothing. | |
Unit-2 |
Teaching Hours:10 |
Stationary Time Series Models
|
|
Wold representation of linear stationary processes, Study of linear time series models: Autoregressive, Moving Average and Autoregressive Moving average models and their statistical properties like ACF and PACF function. | |
Unit-2 |
Teaching Hours:10 |
Stationary Time Series Models
|
|
Wold representation of linear stationary processes, Study of linear time series models: Autoregressive, Moving Average and Autoregressive Moving average models and their statistical properties like ACF and PACF function. | |
Unit-2 |
Teaching Hours:10 |
Stationary Time Series Models
|
|
Wold representation of linear stationary processes, Study of linear time series models: Autoregressive, Moving Average and Autoregressive Moving average models and their statistical properties like ACF and PACF function. | |
Unit-2 |
Teaching Hours:10 |
Stationary Time Series Models
|
|
Wold representation of linear stationary processes, Study of linear time series models: Autoregressive, Moving Average and Autoregressive Moving average models and their statistical properties like ACF and PACF function. | |
Unit-3 |
Teaching Hours:10 |
Estimation of ARMA Models
|
|
Estimation of ARMAmodels: Yule- Walker estimation of AR Processes, Maximum likelihood and least squares estimation for ARMA Processes, Residual analysis and diagnostic checking. | |
Unit-3 |
Teaching Hours:10 |
Estimation of ARMA Models
|
|
Estimation of ARMAmodels: Yule- Walker estimation of AR Processes, Maximum likelihood and least squares estimation for ARMA Processes, Residual analysis and diagnostic checking. | |
Unit-3 |
Teaching Hours:10 |
Estimation of ARMA Models
|
|
Estimation of ARMAmodels: Yule- Walker estimation of AR Processes, Maximum likelihood and least squares estimation for ARMA Processes, Residual analysis and diagnostic checking. | |
Unit-3 |
Teaching Hours:10 |
Estimation of ARMA Models
|
|
Estimation of ARMAmodels: Yule- Walker estimation of AR Processes, Maximum likelihood and least squares estimation for ARMA Processes, Residual analysis and diagnostic checking. | |
Unit-4 |
Teaching Hours:10 |
Nonstationary Time Series Models
|
|
Concept of non-stationarity, general unit root tests for testing non-stationarity; basic formulation of the ARIMA Model and their statistical properties-ACF and PACF; forecasting using ARIMA models | |
Unit-4 |
Teaching Hours:10 |
Nonstationary Time Series Models
|
|
Concept of non-stationarity, general unit root tests for testing non-stationarity; basic formulation of the ARIMA Model and their statistical properties-ACF and PACF; forecasting using ARIMA models | |
Unit-4 |
Teaching Hours:10 |
Nonstationary Time Series Models
|
|
Concept of non-stationarity, general unit root tests for testing non-stationarity; basic formulation of the ARIMA Model and their statistical properties-ACF and PACF; forecasting using ARIMA models | |
Unit-4 |
Teaching Hours:10 |
Nonstationary Time Series Models
|
|
Concept of non-stationarity, general unit root tests for testing non-stationarity; basic formulation of the ARIMA Model and their statistical properties-ACF and PACF; forecasting using ARIMA models | |
Text Books And Reference Books: 1. George E. P. Box, G.M. Jenkins, G.C. Reinsel and G. M. Ljung, Time Series analysis Forecasting and Control, 5th Edition, John Wiley & Sons, Inc., New Jersey, 2016. 2. Montgomery D.C, Jennigs C. L and Kulachi M, Introduction to Time Series analysis and Forecasting, 2 nd Edition,John Wiley & Sons, Inc., New Jersey, 2016. | |
Essential Reading / Recommended Reading 1. Anderson T.W., The Statistical Analysis of Time Series, John Wiley& Sons, Inc., New Jersey, 2011. 2. Shumway R.H and Stoffer D.S, Time Series Analysis and its Applications with R Examples, Springer, 2011. 3. Brockwell P.J and Davis R.A, Times series: Theory and Methods, 2nd Edition, Springer-Verlag, 2009. 4. Gupta S.C and Kapoor V.K, Fundamentals of Applied Statistics, 4th Edition (Reprint), Sultan Chand and Sons, 2018. | |
Evaluation Pattern CIA 50% ESE 50% | |
STA641A - APPLIED STATISTICS (2022 Batch) | |
Total Teaching Hours for Semester:45 |
No of Lecture Hours/Week:3 |
Max Marks:100 |
Credits:3 |
Course Objectives/Course Description |
|
This course is designed to teach demographic methods, mortality and fertility rates, concept of index numbers and their usages are explained. Demand analysis helps students to understand the various statistical tools used in demand and supply sector. Educational and psychological statistics are used to emphasize the usage of statistics in real life. |
|
Learning Outcome |
|
CO1: Demonstrate the demographic profiles, mortality and fertility rates. CO2: Infer the concepts of Demand and supply and their importance
CO3: Demonstrate the importance of index numbers and their usage.Demonstrate the importance of index numbers and their usage. |
Unit-1 |
Teaching Hours:15 |
Demographic Methods
|
|
Sources of demographic data-census – register - ad-hoc surveys - hospital records - demographic profiles of Indian census - questionnaire - errors in these data and their adjustment - Measurements of Mortality-CDR, SDR (w.r.t. age and sex), IMR - standardized death rate - complete life table -its main features and uses - Measurements of fertility and reproduction-CBR- General, Age-specific and total fertility rates - GRR and NRR. | |
Unit-1 |
Teaching Hours:15 |
Demographic Methods
|
|
Sources of demographic data-census – register - ad-hoc surveys - hospital records - demographic profiles of Indian census - questionnaire - errors in these data and their adjustment - Measurements of Mortality-CDR, SDR (w.r.t. age and sex), IMR - standardized death rate - complete life table -its main features and uses - Measurements of fertility and reproduction-CBR- General, Age-specific and total fertility rates - GRR and NRR. | |
Unit-1 |
Teaching Hours:15 |
Demographic Methods
|
|
Sources of demographic data-census – register - ad-hoc surveys - hospital records - demographic profiles of Indian census - questionnaire - errors in these data and their adjustment - Measurements of Mortality-CDR, SDR (w.r.t. age and sex), IMR - standardized death rate - complete life table -its main features and uses - Measurements of fertility and reproduction-CBR- General, Age-specific and total fertility rates - GRR and NRR. | |
Unit-1 |
Teaching Hours:15 |
Demographic Methods
|
|
Sources of demographic data-census – register - ad-hoc surveys - hospital records - demographic profiles of Indian census - questionnaire - errors in these data and their adjustment - Measurements of Mortality-CDR, SDR (w.r.t. age and sex), IMR - standardized death rate - complete life table -its main features and uses - Measurements of fertility and reproduction-CBR- General, Age-specific and total fertility rates - GRR and NRR. | |
Unit-2 |
Teaching Hours:10 |
Index Numbers
|
|
Introduction - different types of index numbers - criteria for index numbers - construction of index numbers of prices and quantities - cost of living index numbers - uses and limitations of index numbers. | |
Unit-2 |
Teaching Hours:10 |
Index Numbers
|
|
Introduction - different types of index numbers - criteria for index numbers - construction of index numbers of prices and quantities - cost of living index numbers - uses and limitations of index numbers. | |
Unit-2 |
Teaching Hours:10 |
Index Numbers
|
|
Introduction - different types of index numbers - criteria for index numbers - construction of index numbers of prices and quantities - cost of living index numbers - uses and limitations of index numbers. | |
Unit-2 |
Teaching Hours:10 |
Index Numbers
|
|
Introduction - different types of index numbers - criteria for index numbers - construction of index numbers of prices and quantities - cost of living index numbers - uses and limitations of index numbers. | |
Unit-3 |
Teaching Hours:10 |
Demand Analysis
|
|
Demand and Supply - Price elasticity of demand - Partial and Cross elasticities of demand - Types of data required for estimating elasticity - Pareto’s Law of income distribution - Unity function. | |
Unit-3 |
Teaching Hours:10 |
Demand Analysis
|
|
Demand and Supply - Price elasticity of demand - Partial and Cross elasticities of demand - Types of data required for estimating elasticity - Pareto’s Law of income distribution - Unity function. | |
Unit-3 |
Teaching Hours:10 |
Demand Analysis
|
|
Demand and Supply - Price elasticity of demand - Partial and Cross elasticities of demand - Types of data required for estimating elasticity - Pareto’s Law of income distribution - Unity function. | |
Unit-3 |
Teaching Hours:10 |
Demand Analysis
|
|
Demand and Supply - Price elasticity of demand - Partial and Cross elasticities of demand - Types of data required for estimating elasticity - Pareto’s Law of income distribution - Unity function. | |
Unit-4 |
Teaching Hours:10 |
Psychological and Educational statistics
|
|
Scaling of Mental tests and Psychological data - Scaling of scores on a test - Z-score and scaling
-standardized scores - normalized scores - computation of T-scores for a given frequency distribution - comparison of T- scores and standardized scores - percentile scores - scaling of rankings and ratings in terms of normal curves - Intelligent tests - intelligent quotient and educational quotient. | |
Unit-4 |
Teaching Hours:10 |
Psychological and Educational statistics
|
|
Scaling of Mental tests and Psychological data - Scaling of scores on a test - Z-score and scaling
-standardized scores - normalized scores - computation of T-scores for a given frequency distribution - comparison of T- scores and standardized scores - percentile scores - scaling of rankings and ratings in terms of normal curves - Intelligent tests - intelligent quotient and educational quotient. | |
Unit-4 |
Teaching Hours:10 |
Psychological and Educational statistics
|
|
Scaling of Mental tests and Psychological data - Scaling of scores on a test - Z-score and scaling
-standardized scores - normalized scores - computation of T-scores for a given frequency distribution - comparison of T- scores and standardized scores - percentile scores - scaling of rankings and ratings in terms of normal curves - Intelligent tests - intelligent quotient and educational quotient. | |
Unit-4 |
Teaching Hours:10 |
Psychological and Educational statistics
|
|
Scaling of Mental tests and Psychological data - Scaling of scores on a test - Z-score and scaling
-standardized scores - normalized scores - computation of T-scores for a given frequency distribution - comparison of T- scores and standardized scores - percentile scores - scaling of rankings and ratings in terms of normal curves - Intelligent tests - intelligent quotient and educational quotient. | |
Text Books And Reference Books:
| |
Essential Reading / Recommended Reading
(P) Ltd, 2016.
| |
Evaluation Pattern CIA 50%ESE 50% | |
STA641B - STATISTICAL QUALITY CONTROL (2022 Batch) | |
Total Teaching Hours for Semester:45 |
No of Lecture Hours/Week:3 |
Max Marks:100 |
Credits:3 |
Course Objectives/Course Description |
|
This course is designed to introduce the application of statistical tools on industrial environment to study, analyze and control the quality of products. |
|
Learning Outcome |
|
CO1: Demonstrate the concepts control charts and sampling plans to improve the quality standards of the products. CO2: Apply the idea of Reliability theory to control the quality of industrial outputs.
|
Unit-1 |
Teaching Hours:15 |
Introduction to SQC
|
|
Quality: Definition - dimensions of quality - historical perspective of quality control - historical perspective of Quality Gurus - Quality Hall of Fame - Quality system and standards: Introduction to ISO quality standards - Quality registration - Statistical Process Control - Seven tools of SPC, chance and assignable Causes - Statistical Control Charts - Construction and Statistical basis of 3-σ Control charts - Rational Sub-grouping. | |
Unit-1 |
Teaching Hours:15 |
Introduction to SQC
|
|
Quality: Definition - dimensions of quality - historical perspective of quality control - historical perspective of Quality Gurus - Quality Hall of Fame - Quality system and standards: Introduction to ISO quality standards - Quality registration - Statistical Process Control - Seven tools of SPC, chance and assignable Causes - Statistical Control Charts - Construction and Statistical basis of 3-σ Control charts - Rational Sub-grouping. | |
Unit-2 |
Teaching Hours:10 |
Statistical Process Control
|
|
Control charts for variables: X-bar & R-chart, X-bar & s-chart - Control charts for attributes: np- chart, p-chart, c-chart and u-chart - Comparison between control charts for variables - control charts for attributes - Analysis of patterns on control chart - estimation of process capability. | |
Unit-2 |
Teaching Hours:10 |
Statistical Process Control
|
|
Control charts for variables: X-bar & R-chart, X-bar & s-chart - Control charts for attributes: np- chart, p-chart, c-chart and u-chart - Comparison between control charts for variables - control charts for attributes - Analysis of patterns on control chart - estimation of process capability. | |
Unit-3 |
Teaching Hours:10 |
Statistical Product Control
|
|
Acceptance sampling plan: Principle of acceptance sampling plans - Single and Double sampling plan - OC, AQL, LTPD, AOQ, AOQL, ASN, ATI functions with graphical interpretation - use and interpretation of Dodge and Romig’s sampling inspection plan tables. | |
Unit-3 |
Teaching Hours:10 |
Statistical Product Control
|
|
Acceptance sampling plan: Principle of acceptance sampling plans - Single and Double sampling plan - OC, AQL, LTPD, AOQ, AOQL, ASN, ATI functions with graphical interpretation - use and interpretation of Dodge and Romig’s sampling inspection plan tables. | |
Unit-4 |
Teaching Hours:10 |
Reliability
|
|
Reliability concepts - Reliability of components and systems - Life distributions - reliability functions - hazard rate - common life distributions-Exponential, Gamma and Weibull - System reliability - Series, parallel, stand by systems, r/n systems - Complex systems - Fault tree and event tree analysis - link between quality and reliability. | |
Unit-4 |
Teaching Hours:10 |
Reliability
|
|
Reliability concepts - Reliability of components and systems - Life distributions - reliability functions - hazard rate - common life distributions-Exponential, Gamma and Weibull - System reliability - Series, parallel, stand by systems, r/n systems - Complex systems - Fault tree and event tree analysis - link between quality and reliability. | |
Text Books And Reference Books:
| |
Essential Reading / Recommended Reading
| |
Evaluation Pattern CIA 50% ESE 50% | |
STA641C - BIOSTATISTICS (2022 Batch) | |
Total Teaching Hours for Semester:45 |
No of Lecture Hours/Week:3 |
Max Marks:100 |
Credits:3 |
Course Objectives/Course Description |
|
This course is designed as an application of statistics in medical sciences. The concepts of bioassays, quantitative epidemiology and survival analysis are introduced. R programming is used to analyze the biomedical data. |
|
Learning Outcome |
|
CO1: Demonstrate the basic biological concepts in Statistical genetics
CO2: Infer the bioassays, dose-response estimation, and dose-allocation schemes
CO3: Demonstrate the concepts in epidemiology and design and analysis of epidemiological studies. |
Unit-1 |
Teaching Hours:15 |
Introduction to Statistical Genetics
|
|
Basic biological concepts in genetics - Mendel’s law - Hardy Weinberg equilibrium - estimation of allele frequency - approach to equilibrium for X-linked gene - The law of natural selection - mutation - genetic drift. | |
Unit-1 |
Teaching Hours:15 |
Introduction to Statistical Genetics
|
|
Basic biological concepts in genetics - Mendel’s law - Hardy Weinberg equilibrium - estimation of allele frequency - approach to equilibrium for X-linked gene - The law of natural selection - mutation - genetic drift. | |
Unit-2 |
Teaching Hours:10 |
Bioassays
|
|
The purpose and structure of biological assay - types of biological assays - direct assays - ration estimates - asymptotic distributions: Feller’s theorem - Regression approach to estimating dose response – relationships - Logit and Probit approaches when dose-response curve for standard preparation is unknown - quantal responses - methods of estimation of parameters - estimation of extreme quantiles - dose allocation schemes. | |
Unit-2 |
Teaching Hours:10 |
Bioassays
|
|
The purpose and structure of biological assay - types of biological assays - direct assays - ration estimates - asymptotic distributions: Feller’s theorem - Regression approach to estimating dose response – relationships - Logit and Probit approaches when dose-response curve for standard preparation is unknown - quantal responses - methods of estimation of parameters - estimation of extreme quantiles - dose allocation schemes. | |
Unit-3 |
Teaching Hours:10 |
Quantitative Epidemiology
|
|
Introduction to modern epidemiology - principles of epidemiological investigation - surveillance and disease monitoring in populations - Epidemiologic measures: Organizing and presenting epidemiologic data - measure of disease frequency - measures of effect and association - causation and causal inference - Design and analysis of epidemiologic studies - Types of studies - case-control studies - cohort studies - cross over design - regression models for the estimation of relative risk. | |
Unit-3 |
Teaching Hours:10 |
Quantitative Epidemiology
|
|
Introduction to modern epidemiology - principles of epidemiological investigation - surveillance and disease monitoring in populations - Epidemiologic measures: Organizing and presenting epidemiologic data - measure of disease frequency - measures of effect and association - causation and causal inference - Design and analysis of epidemiologic studies - Types of studies - case-control studies - cohort studies - cross over design - regression models for the estimation of relative risk. | |
Unit-4 |
Teaching Hours:10 |
Survival Analysis
|
|
Introduction to survival analysis - examples and its characteristics - types of survival analysis - survival functions and hazard function - life distributions: Exponential, Gamma, Weibull, Lognormal and Pareto - Linear failure rate - Life tables - KM survival curves and log-rank test - comparison of survival curves - Cox-PH model and its characteristics - stratified Cox-regression model - Cox-regression with time dependent covariates. | |
Unit-4 |
Teaching Hours:10 |
Survival Analysis
|
|
Introduction to survival analysis - examples and its characteristics - types of survival analysis - survival functions and hazard function - life distributions: Exponential, Gamma, Weibull, Lognormal and Pareto - Linear failure rate - Life tables - KM survival curves and log-rank test - comparison of survival curves - Cox-PH model and its characteristics - stratified Cox-regression model - Cox-regression with time dependent covariates. | |
Text Books And Reference Books:
| |
Essential Reading / Recommended Reading
| |
Evaluation Pattern CIA 50% ESE 50% | |
STA641D - STATISTICAL GENETICS (2022 Batch) | |
Total Teaching Hours for Semester:45 |
No of Lecture Hours/Week:3 |
Max Marks:100 |
Credits:3 |
Course Objectives/Course Description |
|
This course is designed to introduce the basic concepts of genetics,estimation of linkage, Application and extension of the equilibrium law under different situation.This course also introduces the concept of inbreeding, Heritability, Repeatability and Geneticcorrelationin large populations. |
|
Learning Outcome |
|
CO1: Demonstrate the basic concepts of genetics and their applications. CO2: Demonstrate Fisher's fundamental theorem of natural selection with different forces. CO3: Demonstrate methods of estimation of Heritability, Repeatability and Genetic correlation. |
Unit-1 |
Teaching Hours:15 |
Segregation and Linkage
|
|
Physical basis of inheritance - Analysis of segregation - detection and estimation of linkage forqualitative characters - Amount of information about linkage - combined estimation - disturbedsegregation. | |
Unit-1 |
Teaching Hours:15 |
Segregation and Linkage
|
|
Physical basis of inheritance - Analysis of segregation - detection and estimation of linkage forqualitative characters - Amount of information about linkage - combined estimation - disturbedsegregation. | |
Unit-2 |
Teaching Hours:10 |
Equilibrium law and sex-linked genes
|
|
Gene and genotypic frequencies - Random mating and Hardy - Weinberg law - Application andextensionoftheequilibriumlaw-Fisher'sfundamentaltheoremofnaturalselection-Disequilibriumduetolinkagefortwopairsofgenes-sex-linkedgenes-Theory ofpathcoefficients. | |
Unit-2 |
Teaching Hours:10 |
Equilibrium law and sex-linked genes
|
|
Gene and genotypic frequencies - Random mating and Hardy - Weinberg law - Application andextensionoftheequilibriumlaw-Fisher'sfundamentaltheoremofnaturalselection-Disequilibriumduetolinkagefortwopairsofgenes-sex-linkedgenes-Theory ofpathcoefficients. | |
Unit-3 |
Teaching Hours:10 |
Inbreeding and Systematic forces
|
|
Conceptsof inbreeding- regular systemof inbreeding- Forcesaffecting gene frequency -selection, mutation and migration - equilibrium between forces in large populations - Randomgeneticdrift-Effect of finitepopulation size. | |
Unit-3 |
Teaching Hours:10 |
Inbreeding and Systematic forces
|
|
Conceptsof inbreeding- regular systemof inbreeding- Forcesaffecting gene frequency -selection, mutation and migration - equilibrium between forces in large populations - Randomgeneticdrift-Effect of finitepopulation size. | |
Unit-4 |
Teaching Hours:10 |
Association and selection index
|
|
Correlations between relatives – Heritability - Repeatability and Genetic correlation - Responsedue to selection - Selection index and its applications in plants and animals - improvementprogrammes-Correlatedresponse to selection. | |
Unit-4 |
Teaching Hours:10 |
Association and selection index
|
|
Correlations between relatives – Heritability - Repeatability and Genetic correlation - Responsedue to selection - Selection index and its applications in plants and animals - improvementprogrammes-Correlatedresponse to selection. | |
Text Books And Reference Books: 1. Laird N.M and Christoph L, The Fundamental of Modern Statistical Genetics, Springer,2011.
2. Balding DJ, Bishop M & Cannings C, Hand Book of Statistical Genetics, 3rd edition, JohnWiley,2007. | |
Essential Reading / Recommended Reading 1. Benjanmin M.N, Manuel A.R.F, Sarah E.M, Danielle P, Statistical Genetics, CRC Press,2008.
2. ShizhongXu,Principles ofStatisticalGenomics, Springer,2013. | |
Evaluation Pattern CIA 50% ESE 50% | |
STA651 - TIME SERIES ANALYSIS AND FORECASTING TECHNIQUES PRACTICAL (2022 Batch) | |
Total Teaching Hours for Semester:30 |
No of Lecture Hours/Week:2 |
Max Marks:50 |
Credits:2 |
Course Objectives/Course Description |
|
The course is designed to provide a practical exposure to the students in Time Series analysis |
|
Learning Outcome |
|
CO1: Demonstrate the analyses of univariate time series for real time data CO2: Forecast the future values of a given univariate time series. |
Unit-1 |
Teaching Hours:30 |
Practical assignments using R programming:
|
|
1. Time series plots, Decomposition of time series. 2. ACF, PACF plots and their interpretation 3. Smoothing techniques – Simple, Moving average methods, Differenced series. 4. Fitting Autoregressive 5. Fitting of Moving average models. 6. Model identification using ACF and PACF. 7. Residual analysis and diagnostic checking of AR models 8. Residual analysis and diagnostic checking of MA models 9. Testing for stationarity. 10. Fitting ARMA, ARIMA models. 11. Residual analysis and diagnostic checking of ARMA , ARIMA models 12. Forecasting using ARIMA models. | |
Unit-1 |
Teaching Hours:30 |
Practical assignments using R programming:
|
|
1. Time series plots, Decomposition of time series. 2. ACF, PACF plots and their interpretation 3. Smoothing techniques – Simple, Moving average methods, Differenced series. 4. Fitting Autoregressive 5. Fitting of Moving average models. 6. Model identification using ACF and PACF. 7. Residual analysis and diagnostic checking of AR models 8. Residual analysis and diagnostic checking of MA models 9. Testing for stationarity. 10. Fitting ARMA, ARIMA models. 11. Residual analysis and diagnostic checking of ARMA , ARIMA models 12. Forecasting using ARIMA models. | |
Unit-1 |
Teaching Hours:30 |
Practical assignments using R programming:
|
|
1. Time series plots, Decomposition of time series. 2. ACF, PACF plots and their interpretation 3. Smoothing techniques – Simple, Moving average methods, Differenced series. 4. Fitting Autoregressive 5. Fitting of Moving average models. 6. Model identification using ACF and PACF. 7. Residual analysis and diagnostic checking of AR models 8. Residual analysis and diagnostic checking of MA models 9. Testing for stationarity. 10. Fitting ARMA, ARIMA models. 11. Residual analysis and diagnostic checking of ARMA , ARIMA models 12. Forecasting using ARIMA models. | |
Unit-1 |
Teaching Hours:30 |
Practical assignments using R programming:
|
|
1. Time series plots, Decomposition of time series. 2. ACF, PACF plots and their interpretation 3. Smoothing techniques – Simple, Moving average methods, Differenced series. 4. Fitting Autoregressive 5. Fitting of Moving average models. 6. Model identification using ACF and PACF. 7. Residual analysis and diagnostic checking of AR models 8. Residual analysis and diagnostic checking of MA models 9. Testing for stationarity. 10. Fitting ARMA, ARIMA models. 11. Residual analysis and diagnostic checking of ARMA , ARIMA models 12. Forecasting using ARIMA models. | |
Text Books And Reference Books:
1. George E. P. Box, G.M. Jenkins, G.C. Reinsel and G. M. Ljung, Time Series analysis Forecasting and Control, 5th Edition, John Wiley & Sons, Inc., New Jersey, 2016. 2. Montgomery D.C, Jennigs C. L and Kulachi M,Introduction to Time Series analysis and Forecasting, 2nd Edition,John Wiley & Sons, Inc., New Jersey, 2016. | |
Essential Reading / Recommended Reading
1. Anderson T.W,Statistical Analysis of Time Series, John Wiley& Sons, Inc., New Jersey, 1971. 2. Shumway R.H and Stoffer D.S, Time Series Analysis and its Applications with R Examples, Springer, 2011. 3. Brockwell P.J and Davis R.A, Times series: Theory and Methods, 2nd Edition, Springer-Verlag, 2009. 4. Gupta S.C and Kapoor V.K, Fundamentals of Applied Statistics, 4th Edition (Reprint), Sultan Chand and Sons, 2018. | |
Evaluation Pattern CIA 50%
ESE 50% | |
STA652A - APPLIED STATISTICS PRACTICAL (2022 Batch) | |
Total Teaching Hours for Semester:30 |
No of Lecture Hours/Week:2 |
Max Marks:50 |
Credits:2 |
Course Objectives/Course Description |
|
This course is designed to teach practical problems in demographic methods,Demand analysis, indexnumbers and educational statistics. |
|
Learning Outcome |
|
CO1: Demonstrate and evaluate demographic profiles, calculate various index numbers.
CO2: Apply concepts of Psychological and educational statistics for real life problems. |
Unit-1 |
Teaching Hours:30 |
Practical assignments using EXCEL:
|
|
1. Measures of Mortality and IMR2. Measures of fertility3. Construction of life tables.4. Construction of weighted and unweighted Index numbers5. Construction of Price and Quantity index numbers6. Tests for index numbers7. Construction of Cost of living index numbers8. Computation of T-scores for a given frequency distribution9. Psychological and educational statistics-1 (Computation of various scores)10. Psychological and educational statistics-2 (Scaling of ranking & ratings) | |
Unit-1 |
Teaching Hours:30 |
Practical assignments using EXCEL:
|
|
1. Measures of Mortality and IMR2. Measures of fertility3. Construction of life tables.4. Construction of weighted and unweighted Index numbers5. Construction of Price and Quantity index numbers6. Tests for index numbers7. Construction of Cost of living index numbers8. Computation of T-scores for a given frequency distribution9. Psychological and educational statistics-1 (Computation of various scores)10. Psychological and educational statistics-2 (Scaling of ranking & ratings) | |
Unit-1 |
Teaching Hours:30 |
Practical assignments using EXCEL:
|
|
1. Measures of Mortality and IMR2. Measures of fertility3. Construction of life tables.4. Construction of weighted and unweighted Index numbers5. Construction of Price and Quantity index numbers6. Tests for index numbers7. Construction of Cost of living index numbers8. Computation of T-scores for a given frequency distribution9. Psychological and educational statistics-1 (Computation of various scores)10. Psychological and educational statistics-2 (Scaling of ranking & ratings) | |
Unit-1 |
Teaching Hours:30 |
Practical assignments using EXCEL:
|
|
1. Measures of Mortality and IMR2. Measures of fertility3. Construction of life tables.4. Construction of weighted and unweighted Index numbers5. Construction of Price and Quantity index numbers6. Tests for index numbers7. Construction of Cost of living index numbers8. Computation of T-scores for a given frequency distribution9. Psychological and educational statistics-1 (Computation of various scores)10. Psychological and educational statistics-2 (Scaling of ranking & ratings) | |
Text Books And Reference Books: 1. Gupta S.C and Kapoor V.K, Fundamentals of Applied Statistics, 4th Edition (Reprint),SultanChand and Sons, New Delhi, 2018. 2.Ken Black, Applied Business Statistics: Making Better Business Decisions, 7th Edition,WileyInternational, US, 2012. | |
Essential Reading / Recommended Reading 1. MukhopadhyayP,MathematicalStatistics,2ndeditionrevisedreprint,BooksandAllied (P)Ltd,2016. 2.BorowiakD.SandShapiroA.F,FinancialandActuarialStatistics:AnIntroduction,2ndEdition,CRCPress, BocaRaton, 2013. 3. 3. GoonA.M,GuptaM.KandDasguptaB,AnOutlineofStatisticalTheory(Vol.1),4thEdition,World Press, Kolkata, 2016. | |
Evaluation Pattern CIA 50% ESE 50% | |
STA652B - STATISTICAL QUALITY CONTROL PRACTICAL (2022 Batch) | |
Total Teaching Hours for Semester:30 |
No of Lecture Hours/Week:2 |
Max Marks:50 |
Credits:2 |
Course Objectives/Course Description |
|
The course is designed to provide a practical exposure to the students for the various statistical quality control tools. |
|
Learning Outcome |
|
CO1: Demonstrate the variable and attribute control charts for industrial data
CO2: Demonstrate the sampling plans using R programming/EXCEL.
|
Unit-1 |
Teaching Hours:30 |
Practical assignments using R programming/EXCEL
|
|
| |
Unit-1 |
Teaching Hours:30 |
Practical assignments using R programming/EXCEL
|
|
| |
Text Books And Reference Books:
| |
Essential Reading / Recommended Reading
| |
Evaluation Pattern CIA 50% ESE 50% | |
STA652C - BIOSTATISTICS PRACTICAL (2022 Batch) | |
Total Teaching Hours for Semester:30 |
No of Lecture Hours/Week:2 |
Max Marks:50 |
Credits:2 |
Course Objectives/Course Description |
|
This course is designed to teach practical bio statistical problems using statistical softwares. |
|
Learning Outcome |
|
CO1: Demonstrate and evaluate bio statistical models using R programming. |
Unit-1 |
Teaching Hours:30 |
Practical assignments using R programming:
|
|
| |
Unit-1 |
Teaching Hours:30 |
Practical assignments using R programming:
|
|
| |
Text Books And Reference Books:
| |
Essential Reading / Recommended Reading Danial W.W, Cross C.L, Biostatistics: Basic concepts and Methodology for the Health Sciences, 10th Edition, John Wiley, 2014. | |
Evaluation Pattern CIA 50% ESE 50% | |
STA652D - STATISTICAL GENETICS PRACTICAL (2022 Batch) | |
Total Teaching Hours for Semester:30 |
No of Lecture Hours/Week:2 |
Max Marks:50 |
Credits:2 |
Course Objectives/Course Description |
|
This course is designed to teach practical biostatistical problems using statistical softwares. |
|
Learning Outcome |
|
CO1: Demonstrate and evaluate bio statistical models using R programming. |
Unit-1 |
Teaching Hours:30 |
Practical assignments using R programming:
|
|
1. Analysis of segregation,detection and estimation of linkage2. Estimation of Amount of information about linkage3. Calculation of combined estimation of linkage4. Estimation of disequilibrium due to Linkage for two pairs of genes5. Estimation of path coefficients6. Estimation of equilibrium between forces in large populations7. Correlations between relatives and Heritability8. Correlations between Repeatability and Genetic correlation | |
Unit-1 |
Teaching Hours:30 |
Practical assignments using R programming:
|
|
1. Analysis of segregation,detection and estimation of linkage2. Estimation of Amount of information about linkage3. Calculation of combined estimation of linkage4. Estimation of disequilibrium due to Linkage for two pairs of genes5. Estimation of path coefficients6. Estimation of equilibrium between forces in large populations7. Correlations between relatives and Heritability8. Correlations between Repeatability and Genetic correlation | |
Text Books And Reference Books: 1. Laird N.M and Christoph L, The Fundamental of Modern Statistical Genetics, Springer,2011. 2. Balding DJ, Bishop M & Cannings C, Hand Book of Statistical Genetics, 3rd edition, JohnWiley,2007. | |
Essential Reading / Recommended Reading 1. Benjanmin M.N, Manuel A.R.F, Sarah E.M, Danielle P, Statistical Genetics, CRC Press,2008. 2. ShizhongXu,Principles ofStatisticalGenomics, Springer,2013. | |
Evaluation Pattern CIA 50% ESE 50% |